/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:53:07,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:53:07,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:53:07,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:53:07,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:53:07,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:53:07,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:53:07,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:53:07,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:53:07,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:53:07,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:53:07,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:53:07,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:53:07,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:53:07,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:53:07,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:53:07,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:53:07,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:53:07,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:53:07,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:53:07,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:53:07,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:53:07,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:53:07,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:53:07,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:53:07,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:53:07,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:53:07,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:53:07,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:53:08,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:53:08,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:53:08,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:53:08,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:53:08,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:53:08,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:53:08,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:53:08,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:53:08,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:53:08,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:53:08,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:53:08,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:53:08,054 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:53:08,068 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:53:08,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:53:08,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:53:08,069 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:53:08,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:53:08,069 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:53:08,070 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:53:08,070 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:53:08,070 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:53:08,070 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:53:08,070 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:53:08,070 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:53:08,071 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:53:08,071 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:53:08,071 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:53:08,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:53:08,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:53:08,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:53:08,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:53:08,072 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:53:08,072 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:53:08,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:53:08,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:53:08,073 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:53:08,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:53:08,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:53:08,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:53:08,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:53:08,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:53:08,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:53:08,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:53:08,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:53:08,256 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:53:08,257 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:53:08,257 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:53:08,325 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_MPPGD9/tmp/541cedb949294a29a9a8a3c771531637/FLAG7e2aaec34 [2020-07-01 12:53:08,653 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:53:08,654 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:53:08,654 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:53:08,660 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_MPPGD9/tmp/541cedb949294a29a9a8a3c771531637/FLAG7e2aaec34 [2020-07-01 12:53:09,071 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_MPPGD9/tmp/541cedb949294a29a9a8a3c771531637 [2020-07-01 12:53:09,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:53:09,083 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:53:09,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:53:09,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:53:09,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:53:09,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7a9615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:53:09,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:53:09,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:53:09,359 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:53:09,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:53:09,391 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:53:09,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09 WrapperNode [2020-07-01 12:53:09,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:53:09,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:53:09,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:53:09,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:53:09,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:53:09,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:53:09,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:53:09,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:53:09,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:53:09,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:53:09,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:53:09,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:53:09,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:53:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:53:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:53:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:53:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:53:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:53:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:53:09,754 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:53:09,754 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-01 12:53:09,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09 BoogieIcfgContainer [2020-07-01 12:53:09,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:53:09,759 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:53:09,759 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:53:09,761 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:53:09,762 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,776 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 35 edges [2020-07-01 12:53:09,778 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:53:09,778 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:53:09,779 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:53:09,779 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:53:09,781 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:53:09,782 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:53:09,782 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:53:09,802 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:53:09,826 INFO L200 BlockEncoder]: SBE split 14 edges [2020-07-01 12:53:09,830 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:53:09,832 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:53:09,873 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-07-01 12:53:09,876 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:53:09,878 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:53:09,878 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:53:09,882 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 12:53:09,883 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:53:09,884 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:53:09,884 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:53:09,884 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:53:09,885 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:53:09,885 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 36 edges [2020-07-01 12:53:09,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:53:09 BasicIcfg [2020-07-01 12:53:09,886 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:53:09,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:53:09,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:53:09,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:53:09,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:53:09" (1/4) ... [2020-07-01 12:53:09,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c3555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (2/4) ... [2020-07-01 12:53:09,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c3555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09" (3/4) ... [2020-07-01 12:53:09,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c3555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:53:09" (4/4) ... [2020-07-01 12:53:09,896 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:53:09,906 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:53:09,914 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-07-01 12:53:09,927 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-07-01 12:53:09,951 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:53:09,951 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:53:09,951 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:53:09,951 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:53:09,951 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:53:09,952 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:53:09,952 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:53:09,952 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:53:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-01 12:53:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:09,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:09,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:09,975 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:53:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 100327, now seen corresponding path program 1 times [2020-07-01 12:53:09,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:09,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559807752] [2020-07-01 12:53:09,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559807752] [2020-07-01 12:53:10,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879477789] [2020-07-01 12:53:10,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,164 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-07-01 12:53:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,238 INFO L93 Difference]: Finished difference Result 40 states and 69 transitions. [2020-07-01 12:53:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,252 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:53:10,252 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:53:10,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:53:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:53:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:53:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2020-07-01 12:53:10,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 35 transitions. Word has length 3 [2020-07-01 12:53:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,292 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 35 transitions. [2020-07-01 12:53:10,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 35 transitions. [2020-07-01 12:53:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:10,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:10,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:53:10,295 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash 100358, now seen corresponding path program 1 times [2020-07-01 12:53:10,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469787307] [2020-07-01 12:53:10,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469787307] [2020-07-01 12:53:10,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179656512] [2020-07-01 12:53:10,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,334 INFO L87 Difference]: Start difference. First operand 21 states and 35 transitions. Second operand 3 states. [2020-07-01 12:53:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,413 INFO L93 Difference]: Finished difference Result 21 states and 35 transitions. [2020-07-01 12:53:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,414 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:53:10,415 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 12:53:10,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 12:53:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-01 12:53:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 12:53:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2020-07-01 12:53:10,419 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 3 [2020-07-01 12:53:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,419 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 23 transitions. [2020-07-01 12:53:10,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 23 transitions. [2020-07-01 12:53:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:10,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:10,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:53:10,421 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash 100360, now seen corresponding path program 1 times [2020-07-01 12:53:10,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044802081] [2020-07-01 12:53:10,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044802081] [2020-07-01 12:53:10,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526078185] [2020-07-01 12:53:10,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,457 INFO L87 Difference]: Start difference. First operand 15 states and 23 transitions. Second operand 3 states. [2020-07-01 12:53:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,494 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2020-07-01 12:53:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,495 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:53:10,495 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:53:10,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:53:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:53:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:53:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:53:10,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2020-07-01 12:53:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,497 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:53:10,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:53:10,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:53:10,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:53:10,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:53:10,535 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:53:10,536 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:53:10,536 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:53:10,536 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,536 INFO L268 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-07-01 12:53:10,536 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L264 CegarLoopResult]: At program point L16-2(lines 15 21) the Hoare annotation is: (and (= 1 (select |#valid| ~x~0.base)) (= ~x~0.offset 0) (= 4 (select |#length| ~x~0.base)) (<= 1 |#StackHeapBarrier|)) [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:53:10,537 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:53:10,538 INFO L268 CegarLoopResult]: For program point L8-6(line 8) no Hoare annotation was computed. [2020-07-01 12:53:10,541 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:53:10,549 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:10,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:10,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:10,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:10,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:53:10 BasicIcfg [2020-07-01 12:53:10,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:53:10,558 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:53:10,558 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:53:10,561 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:53:10,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:10,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:53:09" (1/5) ... [2020-07-01 12:53:10,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b0914d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:53:10, skipping insertion in model container [2020-07-01 12:53:10,563 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:10,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:09" (2/5) ... [2020-07-01 12:53:10,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b0914d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:53:10, skipping insertion in model container [2020-07-01 12:53:10,563 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:10,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09" (3/5) ... [2020-07-01 12:53:10,564 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b0914d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:53:10, skipping insertion in model container [2020-07-01 12:53:10,564 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:10,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:53:09" (4/5) ... [2020-07-01 12:53:10,564 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b0914d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:53:10, skipping insertion in model container [2020-07-01 12:53:10,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:10,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:53:10" (5/5) ... [2020-07-01 12:53:10,566 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:53:10,587 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:53:10,587 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:53:10,588 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:53:10,588 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:53:10,588 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:53:10,588 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:53:10,588 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:53:10,588 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:53:10,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-01 12:53:10,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:53:10,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:53:10,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:53:10,601 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:53:10,601 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:53:10,602 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:53:10,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-01 12:53:10,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:53:10,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:53:10,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:53:10,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:53:10,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:53:10,609 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [70] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= v_~x~0.base_1 0) (= |v_#NULL.base_1| 0) (= v_~x~0.offset_1 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~x~0.base=v_~x~0.base_1, ~x~0.offset=v_~x~0.offset_1, #valid=|v_#valid_1|, #NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~x~0.base, ~x~0.offset, #valid, #NULL.offset, #NULL.base] 13#L-1true [103] L-1-->L13: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_~x~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_~x~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{~x~0.offset=v_~x~0.offset_2, ~x~0.base=v_~x~0.base_2, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_1|, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[~x~0.offset, ~x~0.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, #length, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret6, ULTIMATE.start_main_#t~mem4] 19#L13true [130] L13-->L16-2: Formula: (and (= (store |v_#memory_int_11| v_~x~0.base_21 (store (select |v_#memory_int_11| v_~x~0.base_21) v_~x~0.offset_15 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_10|) (<= 0 v_~x~0.offset_15) (= 1 (select |v_#valid_19| v_~x~0.base_21)) (<= (+ v_~x~0.offset_15 4) (select |v_#length_15| v_~x~0.base_21))) InVars {~x~0.base=v_~x~0.base_21, ~x~0.offset=v_~x~0.offset_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} OutVars{~x~0.base=v_~x~0.base_21, ~x~0.offset=v_~x~0.offset_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 21#L16-2true [2020-07-01 12:53:10,610 INFO L796 eck$LassoCheckResult]: Loop: 21#L16-2true [140] L16-2-->L16: Formula: (and (<= (+ v_~x~0.offset_22 4) (select |v_#length_22| v_~x~0.base_28)) (<= 0 v_~x~0.offset_22) (= 1 (select |v_#valid_32| v_~x~0.base_28)) (< 0 (select (select |v_#memory_int_22| v_~x~0.base_28) v_~x~0.offset_22))) InVars {~x~0.base=v_~x~0.base_28, ~x~0.offset=v_~x~0.offset_22, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x~0.base=v_~x~0.base_28, ~x~0.offset=v_~x~0.offset_22, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 4#L16true [53] L16-->L8-4: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_foo_#res=|v_ULTIMATE.start_foo_#res_3|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_foo_#t~mem0, ULTIMATE.start_foo_#res] 23#L8-4true [133] L8-4-->L8-6: Formula: (and (= |v_ULTIMATE.start_foo_#t~mem0_9| (select (select |v_#memory_int_12| v_~x~0.base_22) v_~x~0.offset_16)) (= 1 (select |v_#valid_24| v_~x~0.base_22)) (<= 0 v_~x~0.offset_16) (= |v_ULTIMATE.start_foo_#t~post1_9| |v_ULTIMATE.start_foo_#t~mem0_9|) (<= (+ v_~x~0.offset_16 4) (select |v_#length_16| v_~x~0.base_22))) InVars {~x~0.base=v_~x~0.base_22, ~x~0.offset=v_~x~0.offset_16, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_9|, ~x~0.base=v_~x~0.base_22, ~x~0.offset=v_~x~0.offset_16, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~mem0] 18#L8-6true [138] L8-6-->L16-2: Formula: (and (= (store |v_#memory_int_19| v_~x~0.base_26 (store (select |v_#memory_int_19| v_~x~0.base_26) v_~x~0.offset_20 (+ |v_ULTIMATE.start_foo_#t~post1_16| (- 1)))) |v_#memory_int_18|) (<= 0 v_~x~0.offset_20) (<= (+ v_~x~0.offset_20 4) (select |v_#length_20| v_~x~0.base_26)) (= 1 (select |v_#valid_30| v_~x~0.base_26))) InVars {ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_16|, ~x~0.base=v_~x~0.base_26, ~x~0.offset=v_~x~0.offset_20, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_19|, #length=|v_#length_20|} OutVars{ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_15|, ~x~0.base=v_~x~0.base_26, ~x~0.offset=v_~x~0.offset_20, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_13|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~mem0, #memory_int, ULTIMATE.start_main_#t~ret7] 21#L16-2true [2020-07-01 12:53:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash 100384, now seen corresponding path program 1 times [2020-07-01 12:53:10,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603553906] [2020-07-01 12:53:10,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:10,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:53:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash 5149455, now seen corresponding path program 1 times [2020-07-01 12:53:10,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219932771] [2020-07-01 12:53:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:10,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:53:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1778322514, now seen corresponding path program 1 times [2020-07-01 12:53:10,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332850378] [2020-07-01 12:53:10,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:10,697 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:53:10,855 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-07-01 12:53:10,915 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:53:10,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:53:10,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:53:10,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:53:10,917 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:53:10,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:10,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:53:10,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:53:10,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 12:53:10,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:53:10,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:53:10,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:10,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:10,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:10,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:10,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:10,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:10,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:53:11,335 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:53:11,341 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:53:11,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:53:11,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:53:11,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:53:11,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:53:11,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:53:11,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:53:11,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:53:11,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:53:11,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:53:11,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:53:11,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:53:11,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:53:11,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:53:11,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:53:11,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:53:11,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:53:11,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:53:11,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:53:11,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:53:11,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:53:11,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:53:11,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:53:11,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:53:11,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:53:11,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:53:11,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:53:11,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:53:11,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:53:11,705 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-01 12:53:11,706 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:53:11,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:53:11,716 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 12:53:11,716 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:53:11,717 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1) = 1*v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1 Supporting invariants [] [2020-07-01 12:53:11,756 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-01 12:53:11,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:53:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:11,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:53:11,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:53:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:11,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:53:11,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:53:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:11,937 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 12:53:11,937 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 12:53:11,941 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-01 12:53:11,945 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states. Second operand 4 states. [2020-07-01 12:53:12,099 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states.. Second operand 4 states. Result 37 states and 72 transitions. Complement of second has 8 states. [2020-07-01 12:53:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 12:53:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 12:53:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2020-07-01 12:53:12,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-01 12:53:12,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:53:12,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-01 12:53:12,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:53:12,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 8 letters. [2020-07-01 12:53:12,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:53:12,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 72 transitions. [2020-07-01 12:53:12,115 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:53:12,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2020-07-01 12:53:12,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 12:53:12,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 12:53:12,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 12:53:12,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:53:12,118 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:53:12,118 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:53:12,118 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:53:12,118 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 12:53:12,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:53:12,118 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:53:12,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 12:53:12,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:53:12 BasicIcfg [2020-07-01 12:53:12,124 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 12:53:12,126 INFO L168 Benchmark]: Toolchain (without parser) took 3042.22 ms. Allocated memory was 649.6 MB in the beginning and 759.2 MB in the end (delta: 109.6 MB). Free memory was 561.6 MB in the beginning and 685.1 MB in the end (delta: -123.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:53:12,126 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:53:12,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.96 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 561.6 MB in the beginning and 655.1 MB in the end (delta: -93.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.81 ms. Allocated memory is still 693.1 MB. Free memory was 655.1 MB in the beginning and 653.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,128 INFO L168 Benchmark]: Boogie Preprocessor took 23.35 ms. Allocated memory is still 693.1 MB. Free memory was 653.7 MB in the beginning and 652.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,128 INFO L168 Benchmark]: RCFGBuilder took 302.88 ms. Allocated memory is still 693.1 MB. Free memory was 652.4 MB in the beginning and 631.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,129 INFO L168 Benchmark]: BlockEncodingV2 took 127.25 ms. Allocated memory is still 693.1 MB. Free memory was 631.4 MB in the beginning and 621.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,130 INFO L168 Benchmark]: TraceAbstraction took 670.06 ms. Allocated memory is still 693.1 MB. Free memory was 620.6 MB in the beginning and 562.8 MB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,130 INFO L168 Benchmark]: BuchiAutomizer took 1566.01 ms. Allocated memory was 693.1 MB in the beginning and 759.2 MB in the end (delta: 66.1 MB). Free memory was 562.8 MB in the beginning and 685.1 MB in the end (delta: -122.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:53:12,134 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 35 edges - StatisticsResult: Encoded RCFG 21 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.96 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 561.6 MB in the beginning and 655.1 MB in the end (delta: -93.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.81 ms. Allocated memory is still 693.1 MB. Free memory was 655.1 MB in the beginning and 653.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.35 ms. Allocated memory is still 693.1 MB. Free memory was 653.7 MB in the beginning and 652.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 302.88 ms. Allocated memory is still 693.1 MB. Free memory was 652.4 MB in the beginning and 631.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 127.25 ms. Allocated memory is still 693.1 MB. Free memory was 631.4 MB in the beginning and 621.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 670.06 ms. Allocated memory is still 693.1 MB. Free memory was 620.6 MB in the beginning and 562.8 MB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1566.01 ms. Allocated memory was 693.1 MB in the beginning and 759.2 MB in the end (delta: 66.1 MB). Free memory was 562.8 MB in the beginning and 685.1 MB in the end (delta: -122.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 12:53:12,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((1 == \valid[x] && x == 0) && 4 == unknown-#length-unknown[x]) && 1 <= unknown-#StackHeapBarrier-unknown - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 64 SDslu, 0 SDs, 0 SdLazy, 59 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 17 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 91 SDslu, 3 SDs, 0 SdLazy, 106 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp88 ukn69 mio100 lsp41 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 12:53:05.720 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_MPPGD9/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:53:12.370 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check