./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:48:35,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:48:35,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:48:35,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:48:35,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:48:35,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:48:35,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:48:35,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:48:35,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:48:35,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:48:35,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:48:35,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:48:35,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:48:35,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:48:35,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:48:35,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:48:35,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:48:35,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:48:35,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:48:35,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:48:35,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:48:35,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:48:35,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:48:35,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:48:35,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:48:35,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:48:35,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:48:35,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:48:35,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:48:35,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:48:35,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:48:35,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:48:35,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:48:35,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:48:35,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:48:35,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:48:35,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:48:35,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:48:35,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:48:35,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:48:35,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:48:35,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:48:35,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:48:35,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:48:35,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:48:35,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:48:35,510 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:48:35,511 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:48:35,511 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:48:35,511 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:48:35,511 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:48:35,511 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:48:35,512 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:48:35,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:48:35,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:48:35,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:48:35,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:48:35,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:48:35,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:48:35,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:48:35,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:48:35,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:48:35,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:48:35,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:48:35,514 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:48:35,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:48:35,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:48:35,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:48:35,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:48:35,515 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:48:35,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:48:35,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:48:35,516 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:48:35,516 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:48:35,517 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:48:35,517 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-28 20:48:35,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:48:35,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:48:35,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:48:35,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:48:35,883 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:48:35,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-28 20:48:35,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416eb5873/fecfa487d4a846649b578abcd9f53b9c/FLAGcdaa5b954 [2019-11-28 20:48:36,480 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:48:36,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-28 20:48:36,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416eb5873/fecfa487d4a846649b578abcd9f53b9c/FLAGcdaa5b954 [2019-11-28 20:48:36,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416eb5873/fecfa487d4a846649b578abcd9f53b9c [2019-11-28 20:48:36,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:48:36,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:48:36,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:36,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:48:36,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:48:36,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:36" (1/1) ... [2019-11-28 20:48:36,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35373ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:36, skipping insertion in model container [2019-11-28 20:48:36,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:36" (1/1) ... [2019-11-28 20:48:36,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:48:36,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:48:37,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:37,296 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:48:37,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:37,427 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:48:37,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37 WrapperNode [2019-11-28 20:48:37,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:37,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:37,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:48:37,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:48:37,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:37,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:48:37,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:48:37,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:48:37,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... [2019-11-28 20:48:37,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:48:37,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:48:37,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:48:37,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:48:37,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:48:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:48:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:48:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:48:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:48:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:48:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:48:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:48:37,967 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:48:37,967 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-28 20:48:37,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:37 BoogieIcfgContainer [2019-11-28 20:48:37,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:48:37,969 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:48:37,969 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:48:37,973 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:48:37,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:37,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:48:36" (1/3) ... [2019-11-28 20:48:37,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76e0bd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:37, skipping insertion in model container [2019-11-28 20:48:37,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:37,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:37" (2/3) ... [2019-11-28 20:48:37,976 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76e0bd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:37, skipping insertion in model container [2019-11-28 20:48:37,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:37,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:37" (3/3) ... [2019-11-28 20:48:37,978 INFO L371 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2019-11-28 20:48:38,018 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:48:38,018 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:48:38,019 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:48:38,019 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:48:38,019 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:48:38,019 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:48:38,019 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:48:38,020 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:48:38,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 20:48:38,056 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-28 20:48:38,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:38,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:38,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:48:38,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:48:38,063 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:48:38,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 20:48:38,065 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-28 20:48:38,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:38,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:38,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:48:38,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:48:38,072 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 11#L522true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L514true [2019-11-28 20:48:38,072 INFO L796 eck$LassoCheckResult]: Loop: 5#L514true assume true; 5#L514true [2019-11-28 20:48:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 20:48:38,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919068762] [2019-11-28 20:48:38,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:38,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919068762] [2019-11-28 20:48:38,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:38,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:48:38,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428332657] [2019-11-28 20:48:38,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash 101, now seen corresponding path program 1 times [2019-11-28 20:48:38,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147294383] [2019-11-28 20:48:38,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:38,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:48:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:48:38,293 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-11-28 20:48:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:38,326 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-11-28 20:48:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:48:38,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-11-28 20:48:38,331 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 20:48:38,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2019-11-28 20:48:38,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:48:38,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:48:38,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-28 20:48:38,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:38,338 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 20:48:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-28 20:48:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 20:48:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:48:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-28 20:48:38,363 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 20:48:38,363 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 20:48:38,363 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:48:38,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-28 20:48:38,364 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 20:48:38,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:38,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:38,365 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:48:38,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:48:38,366 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 57#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 53#L526-2 [2019-11-28 20:48:38,366 INFO L796 eck$LassoCheckResult]: Loop: 53#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 55#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 53#L526-2 [2019-11-28 20:48:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-11-28 20:48:38,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300186828] [2019-11-28 20:48:38,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2019-11-28 20:48:38,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036709348] [2019-11-28 20:48:38,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2019-11-28 20:48:38,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559732535] [2019-11-28 20:48:38,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:38,907 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-11-28 20:48:38,968 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:39,086 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 20:48:39,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:39,095 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:39,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:39,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:39,189 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2019-11-28 20:48:39,422 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:48:39,422 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:48:39,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:48:39,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:48:39,423 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:48:39,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:39,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:48:39,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:48:39,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2019-11-28 20:48:39,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:48:39,424 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:48:39,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:39,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:40,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:48:40,279 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,295 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 [2019-11-28 20:48:40,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:40,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:40,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,336 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 [2019-11-28 20:48:40,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:40,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,360 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 [2019-11-28 20:48:40,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:40,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:40,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,401 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 [2019-11-28 20:48:40,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:40,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,426 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 [2019-11-28 20:48:40,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,430 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:48:40,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,432 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:48:40,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,455 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 [2019-11-28 20:48:40,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:40,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,490 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 [2019-11-28 20:48:40,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:40,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,521 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 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:40,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:40,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:48:40,551 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 [2019-11-28 20:48:40,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:40,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:40,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,574 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 [2019-11-28 20:48:40,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:40,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:40,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,612 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 [2019-11-28 20:48:40,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:40,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:40,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,648 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 [2019-11-28 20:48:40,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:40,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:40,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:40,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:40,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:40,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:40,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:48:40,727 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 20:48:40,727 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:40,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:40,798 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:48:40,798 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:48:40,799 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2019-11-28 20:48:40,840 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 20:48:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:40,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:48:40,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:40,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:48:40,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:40,933 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:48:40,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:48:40,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2019-11-28 20:48:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:48:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:48:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 20:48:40,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:48:40,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:48:40,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:48:40,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:48:40,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:48:40,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:48:40,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 20:48:40,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 20:48:41,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-11-28 20:48:41,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:48:41,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:48:41,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-28 20:48:41,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:48:41,001 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 20:48:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-28 20:48:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 20:48:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:48:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-28 20:48:41,003 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 20:48:41,003 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 20:48:41,003 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:48:41,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-28 20:48:41,004 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 20:48:41,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,005 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:48:41,005 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 145#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 139#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 140#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 135#L538-2 [2019-11-28 20:48:41,006 INFO L796 eck$LassoCheckResult]: Loop: 135#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 134#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 135#L538-2 [2019-11-28 20:48:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,006 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2019-11-28 20:48:41,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11840712] [2019-11-28 20:48:41,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 69737, now seen corresponding path program 1 times [2019-11-28 20:48:41,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834623705] [2019-11-28 20:48:41,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2102156855, now seen corresponding path program 1 times [2019-11-28 20:48:41,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229905602] [2019-11-28 20:48:41,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:41,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229905602] [2019-11-28 20:48:41,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:41,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:48:41,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26810831] [2019-11-28 20:48:41,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:48:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:48:41,316 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 20:48:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:41,436 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-28 20:48:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:48:41,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-28 20:48:41,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2019-11-28 20:48:41,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2019-11-28 20:48:41,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 20:48:41,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 20:48:41,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-11-28 20:48:41,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:48:41,444 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-28 20:48:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-11-28 20:48:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2019-11-28 20:48:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:48:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-28 20:48:41,451 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 20:48:41,451 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 20:48:41,451 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:48:41,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-28 20:48:41,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 20:48:41,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:48:41,454 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 206#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 199#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 202#L529 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L514-1 [2019-11-28 20:48:41,454 INFO L796 eck$LassoCheckResult]: Loop: 205#L514-1 assume true; 205#L514-1 [2019-11-28 20:48:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2019-11-28 20:48:41,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307253960] [2019-11-28 20:48:41,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:41,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307253960] [2019-11-28 20:48:41,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:41,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:48:41,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884937232] [2019-11-28 20:48:41,497 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2019-11-28 20:48:41,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065564435] [2019-11-28 20:48:41,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:48:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:48:41,511 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 20:48:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:41,525 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-28 20:48:41,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:48:41,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 20:48:41,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 20:48:41,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2019-11-28 20:48:41,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:48:41,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:48:41,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 20:48:41,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:41,532 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 20:48:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 20:48:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-28 20:48:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:48:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 20:48:41,535 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 20:48:41,535 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 20:48:41,535 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:48:41,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-28 20:48:41,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:41,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:48:41,537 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 249#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 247#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 242#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 243#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 239#L538-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L538-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L546-2 [2019-11-28 20:48:41,537 INFO L796 eck$LassoCheckResult]: Loop: 241#L546-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 241#L546-2 [2019-11-28 20:48:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash 206358786, now seen corresponding path program 1 times [2019-11-28 20:48:41,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617580799] [2019-11-28 20:48:41,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617580799] [2019-11-28 20:48:41,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:48:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853321803] [2019-11-28 20:48:41,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2019-11-28 20:48:41,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970323194] [2019-11-28 20:48:41,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:48:41,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:48:41,679 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 20:48:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:41,725 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-28 20:48:41,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:48:41,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-28 20:48:41,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:41,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2019-11-28 20:48:41,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:48:41,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:48:41,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-28 20:48:41,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:41,731 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 20:48:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-28 20:48:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-28 20:48:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:48:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-28 20:48:41,733 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 20:48:41,734 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 20:48:41,736 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:48:41,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-28 20:48:41,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:41,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,739 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:48:41,740 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 296#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 294#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 290#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 291#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 292#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 293#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 286#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-28 20:48:41,740 INFO L796 eck$LassoCheckResult]: Loop: 287#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 284#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 285#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-28 20:48:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2019-11-28 20:48:41,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133817372] [2019-11-28 20:48:41,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,785 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 2 times [2019-11-28 20:48:41,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209895982] [2019-11-28 20:48:41,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash -60222244, now seen corresponding path program 1 times [2019-11-28 20:48:41,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153525832] [2019-11-28 20:48:41,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:41,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153525832] [2019-11-28 20:48:41,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331828646] [2019-11-28 20:48:41,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:48:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:42,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 20:48:42,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:42,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:48:42,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,057 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:48:42,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:48:42,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:48:42,140 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,154 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-11-28 20:48:42,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:42,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 20:48:42,190 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,199 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-11-28 20:48:42,238 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 20:48:42,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2019-11-28 20:48:42,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2019-11-28 20:48:42,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:48:42,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-28 20:48:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:42,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:42,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 20:48:42,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587275792] [2019-11-28 20:48:42,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:48:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:48:42,380 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-11-28 20:48:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:42,607 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-28 20:48:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:48:42,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-28 20:48:42,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:42,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2019-11-28 20:48:42,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:48:42,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:48:42,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-28 20:48:42,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:42,610 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 20:48:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-28 20:48:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-11-28 20:48:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:48:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-28 20:48:42,612 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 20:48:42,612 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 20:48:42,612 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:48:42,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-28 20:48:42,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:42,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:42,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:42,613 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:42,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:48:42,614 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 401#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 399#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 400#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 394#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 395#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 403#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 396#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 397#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 405#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 404#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 398#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 390#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L539 [2019-11-28 20:48:42,614 INFO L796 eck$LassoCheckResult]: Loop: 391#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 388#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 389#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L539 [2019-11-28 20:48:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2019-11-28 20:48:42,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926962100] [2019-11-28 20:48:42,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 3 times [2019-11-28 20:48:42,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894248174] [2019-11-28 20:48:42,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 500492529, now seen corresponding path program 2 times [2019-11-28 20:48:42,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848066763] [2019-11-28 20:48:42,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:42,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848066763] [2019-11-28 20:48:42,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498096531] [2019-11-28 20:48:42,856 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:48:42,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:48:42,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:42,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-28 20:48:42,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:42,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:48:42,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:42,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:42,945 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:48:43,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 20:48:43,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,044 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-28 20:48:43,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:48:43,048 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,061 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,061 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-28 20:48:43,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:43,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 20:48:43,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-28 20:48:43,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-28 20:48:43,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:48:43,173 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,191 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:26 [2019-11-28 20:48:43,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 20:48:43,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-11-28 20:48:43,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-11-28 20:48:43,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,277 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,278 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2019-11-28 20:48:43,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:48:43,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2019-11-28 20:48:43,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:43,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:43,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-28 20:48:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:43,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:43,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-28 20:48:43,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227768472] [2019-11-28 20:48:43,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:48:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:48:43,390 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2019-11-28 20:48:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:43,811 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-28 20:48:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:48:43,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-11-28 20:48:43,812 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:48:43,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-11-28 20:48:43,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:48:43,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:48:43,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:48:43,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:43,813 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:48:43,814 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:48:43,814 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:48:43,814 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:48:43,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:48:43,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:48:43,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:48:43,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:48:43 BoogieIcfgContainer [2019-11-28 20:48:43,821 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:48:43,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:48:43,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:48:43,822 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:48:43,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:37" (3/4) ... [2019-11-28 20:48:43,827 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:48:43,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:48:43,829 INFO L168 Benchmark]: Toolchain (without parser) took 7027.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 961.7 MB in the beginning and 815.9 MB in the end (delta: 145.8 MB). Peak memory consumption was 342.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:43,829 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:48:43,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:43,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:43,831 INFO L168 Benchmark]: Boogie Preprocessor took 35.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:48:43,831 INFO L168 Benchmark]: RCFGBuilder took 449.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:43,832 INFO L168 Benchmark]: BuchiAutomizer took 5852.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 815.9 MB in the end (delta: 247.5 MB). Peak memory consumption was 330.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:43,832 INFO L168 Benchmark]: Witness Printer took 5.55 ms. Allocated memory is still 1.2 GB. Free memory is still 815.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:48:43,835 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 449.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5852.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 815.9 MB in the end (delta: 247.5 MB). Peak memory consumption was 330.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.55 ms. Allocated memory is still 1.2 GB. Free memory is still 815.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 127 SDslu, 62 SDs, 0 SdLazy, 263 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax109 hnf100 lsp86 ukn51 mio100 lsp33 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf172 smp93 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms 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! Received shutdown request...