./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer --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 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:51:52,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:51:52,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:51:52,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:51:52,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:51:52,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:51:52,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:51:52,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:51:52,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:51:52,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:51:52,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:51:52,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:51:52,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:51:52,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:51:52,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:51:52,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:51:52,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:51:52,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:51:52,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:51:52,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:51:52,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:51:52,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:51:52,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:51:52,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:51:52,505 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:51:52,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:51:52,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:51:52,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:51:52,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:51:52,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:51:52,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:51:52,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:51:52,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:51:52,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:51:52,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:51:52,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:51:52,509 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:51:52,516 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:51:52,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:51:52,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:51:52,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:51:52,518 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:51:52,518 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:51:52,518 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:51:52,518 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:51:52,518 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:51:52,518 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:51:52,519 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:51:52,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:51:52,519 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:51:52,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:51:52,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:51:52,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:51:52,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:51:52,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:51:52,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:51:52,520 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:51:52,520 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:51:52,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:51:52,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:51:52,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:51:52,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:51:52,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:51:52,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:51:52,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:51:52,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:51:52,522 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2018-11-28 11:51:52,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:51:52,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:51:52,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:51:52,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:51:52,561 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:51:52,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 11:51:52,608 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/data/0d6f28884/7155ddb95fae426d8561f72becda9045/FLAG646d6df26 [2018-11-28 11:51:52,943 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:51:52,943 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 11:51:52,947 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/data/0d6f28884/7155ddb95fae426d8561f72becda9045/FLAG646d6df26 [2018-11-28 11:51:53,371 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/data/0d6f28884/7155ddb95fae426d8561f72becda9045 [2018-11-28 11:51:53,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:51:53,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:51:53,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:51:53,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:51:53,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:51:53,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e86348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53, skipping insertion in model container [2018-11-28 11:51:53,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:51:53,393 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:51:53,487 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:51:53,494 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:51:53,504 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:51:53,513 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:51:53,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53 WrapperNode [2018-11-28 11:51:53,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:51:53,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:51:53,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:51:53,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:51:53,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:51:53,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:51:53,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:51:53,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:51:53,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... [2018-11-28 11:51:53,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:51:53,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:51:53,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:51:53,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:51:53,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/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 [2018-11-28 11:51:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:51:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:51:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:51:53,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:51:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:51:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:51:53,760 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:51:53,760 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:51:53,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:53 BoogieIcfgContainer [2018-11-28 11:51:53,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:51:53,761 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:51:53,761 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:51:53,764 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:51:53,764 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:51:53,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:51:53" (1/3) ... [2018-11-28 11:51:53,765 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@636f926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:51:53, skipping insertion in model container [2018-11-28 11:51:53,765 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:51:53,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:53" (2/3) ... [2018-11-28 11:51:53,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@636f926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:51:53, skipping insertion in model container [2018-11-28 11:51:53,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:51:53,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:53" (3/3) ... [2018-11-28 11:51:53,767 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 11:51:53,807 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:51:53,807 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:51:53,807 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:51:53,807 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:51:53,808 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:51:53,808 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:51:53,808 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:51:53,808 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:51:53,808 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:51:53,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 11:51:53,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:51:53,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:53,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:53,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:51:53,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:51:53,840 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:51:53,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 11:51:53,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:51:53,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:53,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:53,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:51:53,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:51:53,848 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2018-11-28 11:51:53,849 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2018-11-28 11:51:53,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:53,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:51:53,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:53,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:53,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-11-28 11:51:53,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:53,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:53,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:53,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:53,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:53,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-28 11:51:53,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:53,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:53,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:54,520 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-11-28 11:51:54,673 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 11:51:54,690 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:51:54,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:51:54,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:51:54,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:51:54,691 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:51:54,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:51:54,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:51:54,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:51:54,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-11-28 11:51:54,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:51:54,692 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:51:54,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:54,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:54,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:54,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:55,078 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-11-28 11:51:55,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:55,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:55,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:55,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:55,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:55,499 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:51:55,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:51:55,503 INFO L122 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 [2018-11-28 11:51:55,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:51:55,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:51:55,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:51:55,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,508 INFO L122 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 [2018-11-28 11:51:55,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,514 INFO L122 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 [2018-11-28 11:51:55,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:51:55,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:51:55,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:51:55,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,517 INFO L122 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 [2018-11-28 11:51:55,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,556 INFO L122 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 [2018-11-28 11:51:55,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,557 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:51:55,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,559 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:51:55,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,568 INFO L122 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 [2018-11-28 11:51:55,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,569 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:51:55,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,571 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:51:55,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,579 INFO L122 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 [2018-11-28 11:51:55,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,589 INFO L122 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 [2018-11-28 11:51:55,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,594 INFO L122 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 [2018-11-28 11:51:55,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,600 INFO L122 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 [2018-11-28 11:51:55,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,602 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:51:55,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,604 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:51:55,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,611 INFO L122 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 [2018-11-28 11:51:55,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,615 INFO L122 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 [2018-11-28 11:51:55,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,620 INFO L122 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 [2018-11-28 11:51:55,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,624 INFO L122 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 [2018-11-28 11:51:55,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,632 INFO L122 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 [2018-11-28 11:51:55,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,633 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:51:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,634 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:51:55,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,639 INFO L122 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 [2018-11-28 11:51:55,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,646 INFO L122 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 [2018-11-28 11:51:55,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,653 INFO L122 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 [2018-11-28 11:51:55,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:55,657 INFO L122 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 [2018-11-28 11:51:55,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:55,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:55,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:55,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:55,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:55,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:55,664 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:51:55,670 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:51:55,670 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:51:55,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:51:55,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:51:55,673 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:51:55,674 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2018-11-28 11:51:55,795 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 11:51:55,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:51:55,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:55,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:55,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:55,886 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 [2018-11-28 11:51:55,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-11-28 11:51:55,930 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2018-11-28 11:51:55,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:51:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:51:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 11:51:55,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-28 11:51:55,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:51:55,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 11:51:55,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:51:55,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 11:51:55,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:51:55,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-11-28 11:51:55,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:51:55,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2018-11-28 11:51:55,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:51:55,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:51:55,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-11-28 11:51:55,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:51:55,943 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 11:51:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-11-28 11:51:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 11:51:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 11:51:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-28 11:51:55,965 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 11:51:55,965 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 11:51:55,965 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:51:55,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-28 11:51:55,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:51:55,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:55,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:55,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:51:55,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:51:55,967 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2018-11-28 11:51:55,967 INFO L796 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2018-11-28 11:51:55,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-28 11:51:55,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:56,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:51:56,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:51:56,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:51:56,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2018-11-28 11:51:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:51:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:51:56,167 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 11:51:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:51:56,225 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-28 11:51:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:51:56,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 11:51:56,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:51:56,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2018-11-28 11:51:56,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:51:56,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:51:56,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 11:51:56,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:51:56,228 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 11:51:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 11:51:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-28 11:51:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 11:51:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 11:51:56,229 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 11:51:56,229 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 11:51:56,229 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:51:56,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 11:51:56,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:51:56,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:56,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:56,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-28 11:51:56,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:51:56,230 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 285#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 286#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 292#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 290#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 291#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 293#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 288#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2018-11-28 11:51:56,230 INFO L796 eck$LassoCheckResult]: Loop: 289#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 295#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 297#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2018-11-28 11:51:56,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-11-28 11:51:56,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2018-11-28 11:51:56,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:56,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2018-11-28 11:51:56,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:51:56,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:51:56,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:51:56,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:56,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:56,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 29 [2018-11-28 11:51:56,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:56,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:56,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:51:56,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-11-28 11:51:56,537 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:51:56,539 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:56,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-28 11:51:56,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:56,582 INFO L478 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 20 [2018-11-28 11:51:56,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:51:56,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-28 11:51:56,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:51:56,608 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:56,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:56,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-11-28 11:51:56,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:51:56,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-28 11:51:56,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 11:51:56,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:56,657 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 11:51:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:56,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:51:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 11:51:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:51:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:51:56,737 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2018-11-28 11:51:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:51:56,837 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-28 11:51:56,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:51:56,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-28 11:51:56,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:51:56,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-11-28 11:51:56,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 11:51:56,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 11:51:56,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-28 11:51:56,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:51:56,839 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-28 11:51:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-28 11:51:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-11-28 11:51:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 11:51:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 11:51:56,841 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 11:51:56,841 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 11:51:56,841 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:51:56,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 11:51:56,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:51:56,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:56,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:56,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:51:56,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-11-28 11:51:56,842 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 374#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 375#L24-2 [2018-11-28 11:51:56,842 INFO L796 eck$LassoCheckResult]: Loop: 375#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 384#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 376#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 377#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 379#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 382#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 383#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 375#L24-2 [2018-11-28 11:51:56,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:51:56,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:56,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2018-11-28 11:51:56,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:51:56,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2018-11-28 11:51:56,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:56,990 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-28 11:51:57,306 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-11-28 11:51:57,426 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 11:51:57,428 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:51:57,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:51:57,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:51:57,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:51:57,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:51:57,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:51:57,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:51:57,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:51:57,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-11-28 11:51:57,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:51:57,429 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:51:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,674 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-28 11:51:57,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:57,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:51:58,065 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:51:58,065 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:51:58,065 INFO L122 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 [2018-11-28 11:51:58,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:58,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:58,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:58,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:58,071 INFO L122 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 [2018-11-28 11:51:58,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:51:58,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:58,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:51:58,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:51:58,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:58,073 INFO L122 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 [2018-11-28 11:51:58,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:58,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:58,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:58,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:58,078 INFO L122 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 [2018-11-28 11:51:58,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:58,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:58,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:58,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:58,086 INFO L122 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 [2018-11-28 11:51:58,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:58,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:58,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:58,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:58,090 INFO L122 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 [2018-11-28 11:51:58,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:51:58,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,092 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:51:58,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:58,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:51:58,095 INFO L122 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 [2018-11-28 11:51:58,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:51:58,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:51:58,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:51:58,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:51:58,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:51:58,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:51:58,103 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:51:58,106 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:51:58,106 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:51:58,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:51:58,107 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:51:58,107 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:51:58,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2018-11-28 11:51:58,199 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 11:51:58,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:51:58,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:58,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:58,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:58,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-11-28 11:51:58,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-28 11:51:58,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2018-11-28 11:51:58,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 11:51:58,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:51:58,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:51:58,356 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-11-28 11:51:58,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,387 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:51:58,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:51:58,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,438 INFO L478 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 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 11:51:58,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-28 11:51:58,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-11-28 11:51:58,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:51:58,482 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-28 11:51:58,503 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-11-28 11:51:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:58,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:51:58,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-28 11:51:58,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2018-11-28 11:51:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 11:51:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 11:51:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 11:51:58,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 11:51:58,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:51:58,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 11:51:58,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:51:58,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 11:51:58,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:51:58,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-28 11:51:58,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:51:58,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 11:51:58,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:51:58,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:51:58,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-28 11:51:58,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:51:58,628 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 11:51:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-28 11:51:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 11:51:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 11:51:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 11:51:58,630 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 11:51:58,630 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 11:51:58,630 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:51:58,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-28 11:51:58,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:51:58,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:58,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:58,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:51:58,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:51:58,632 INFO L794 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 641#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 642#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 652#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 653#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 666#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 665#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 664#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 655#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2018-11-28 11:51:58,632 INFO L796 eck$LassoCheckResult]: Loop: 651#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 648#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 649#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 661#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 660#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2018-11-28 11:51:58,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2018-11-28 11:51:58,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:58,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:58,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:51:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:58,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:51:58,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:51:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:58,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:58,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 40 [2018-11-28 11:51:58,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-28 11:51:58,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:58,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-28 11:51:58,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,935 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2018-11-28 11:51:58,937 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:58,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2018-11-28 11:51:58,950 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:58,950 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-28 11:51:58,964 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:58,964 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-28 11:51:58,981 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:58,982 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,991 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:58,997 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,002 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:59,017 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2018-11-28 11:51:59,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:59,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2018-11-28 11:51:59,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:51:59,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:59,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2018-11-28 11:51:59,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-11-28 11:51:59,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-28 11:51:59,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 11:51:59,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 11:51:59,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 11:51:59,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,170 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:76, output treesize:3 [2018-11-28 11:51:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:51:59,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:51:59,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-28 11:51:59,193 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:51:59,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2018-11-28 11:51:59,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:59,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:51:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:51:59,294 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-28 11:51:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:51:59,487 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 11:51:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:51:59,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-11-28 11:51:59,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:51:59,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-11-28 11:51:59,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 11:51:59,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 11:51:59,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-11-28 11:51:59,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:51:59,489 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 11:51:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-11-28 11:51:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-11-28 11:51:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 11:51:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-28 11:51:59,491 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 11:51:59,491 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 11:51:59,491 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:51:59,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-28 11:51:59,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:51:59,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:51:59,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:51:59,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-28 11:51:59,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:51:59,497 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 761#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 771#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 765#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 766#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 776#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 775#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 769#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 770#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 785#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 774#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2018-11-28 11:51:59,497 INFO L796 eck$LassoCheckResult]: Loop: 772#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 767#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 768#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 780#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 778#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2018-11-28 11:51:59,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2018-11-28 11:51:59,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:59,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:59,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2018-11-28 11:51:59,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:59,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:59,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:59,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:51:59,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:59,532 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2018-11-28 11:51:59,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:59,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:51:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:51:59,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:51:59,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:51:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:59,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:59,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:59,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 29 [2018-11-28 11:51:59,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:59,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:59,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:51:59,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 11:51:59,704 INFO L478 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 11 treesize of output 8 [2018-11-28 11:51:59,706 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:59,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-28 11:51:59,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-28 11:51:59,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-28 11:51:59,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-11-28 11:51:59,748 INFO L478 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 11 treesize of output 8 [2018-11-28 11:51:59,751 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:59,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-28 11:51:59,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:51:59,776 INFO L478 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 8 treesize of output 7 [2018-11-28 11:51:59,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:59,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-11-28 11:51:59,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:51:59,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 11:51:59,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-28 11:51:59,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:59,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2018-11-28 11:51:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:51:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:51:59,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-28 11:51:59,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:51:59,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:51:59,983 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-11-28 11:52:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:00,281 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 11:52:00,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 11:52:00,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2018-11-28 11:52:00,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 11:52:00,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 11:52:00,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 11:52:00,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 11:52:00,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2018-11-28 11:52:00,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:52:00,283 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 11:52:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2018-11-28 11:52:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-28 11:52:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 11:52:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 11:52:00,284 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 11:52:00,284 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 11:52:00,284 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:52:00,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-11-28 11:52:00,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 11:52:00,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:00,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:00,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-28 11:52:00,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:52:00,285 INFO L794 eck$LassoCheckResult]: Stem: 938#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 933#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 943#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 936#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 937#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 959#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 951#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 949#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 941#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 942#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 946#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 964#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 963#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 962#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 950#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 944#L24 [2018-11-28 11:52:00,286 INFO L796 eck$LassoCheckResult]: Loop: 944#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 939#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 940#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 960#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 958#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 944#L24 [2018-11-28 11:52:00,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2018-11-28 11:52:00,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:00,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 53784836, now seen corresponding path program 1 times [2018-11-28 11:52:00,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:00,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:52:00,350 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:52:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:52:00,350 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 11:52:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:00,377 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-28 11:52:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:52:00,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-28 11:52:00,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 11:52:00,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2018-11-28 11:52:00,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 11:52:00,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 11:52:00,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-28 11:52:00,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:52:00,378 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-28 11:52:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-28 11:52:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 11:52:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 11:52:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-28 11:52:00,380 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-28 11:52:00,380 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-28 11:52:00,380 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:52:00,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-11-28 11:52:00,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 11:52:00,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:00,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:00,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-28 11:52:00,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2018-11-28 11:52:00,381 INFO L794 eck$LassoCheckResult]: Stem: 1010#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1008#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1009#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1025#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1013#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1014#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1017#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1020#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1022#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1023#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1026#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1038#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1037#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1036#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1035#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1024#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1018#L24 [2018-11-28 11:52:00,381 INFO L796 eck$LassoCheckResult]: Loop: 1018#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1019#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1031#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1030#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1029#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1028#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1027#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1021#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1015#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1016#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1011#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1012#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1034#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1032#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1033#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1018#L24 [2018-11-28 11:52:00,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2018-11-28 11:52:00,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:00,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:00,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:00,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2018-11-28 11:52:00,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:00,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2018-11-28 11:52:00,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:00,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:00,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:00,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:00,906 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2018-11-28 11:52:01,048 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 11:52:03,263 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 189 DAG size of output: 159 [2018-11-28 11:52:03,701 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-28 11:52:03,704 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:52:03,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:52:03,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:52:03,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:52:03,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:52:03,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:52:03,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:52:03,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:52:03,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Lasso [2018-11-28 11:52:03,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:52:03,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:52:03,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:03,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:03,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:03,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:04,127 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2018-11-28 11:52:04,240 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-28 11:52:04,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:04,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:04,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:04,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:04,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:04,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:52:04,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:52:04,560 INFO L122 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 [2018-11-28 11:52:04,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:04,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:04,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:04,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,564 INFO L122 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 [2018-11-28 11:52:04,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,567 INFO L122 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 [2018-11-28 11:52:04,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:04,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:04,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:04,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,568 INFO L122 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 [2018-11-28 11:52:04,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,569 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:52:04,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,570 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:52:04,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,572 INFO L122 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 [2018-11-28 11:52:04,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,573 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:52:04,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,574 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:52:04,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,576 INFO L122 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 [2018-11-28 11:52:04,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,577 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:52:04,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,578 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:52:04,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,580 INFO L122 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 [2018-11-28 11:52:04,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,584 INFO L122 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 [2018-11-28 11:52:04,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,587 INFO L122 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 [2018-11-28 11:52:04,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,601 INFO L122 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 [2018-11-28 11:52:04,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,601 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:52:04,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,602 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:52:04,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,605 INFO L122 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 [2018-11-28 11:52:04,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,609 INFO L122 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 [2018-11-28 11:52:04,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,613 INFO L122 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 [2018-11-28 11:52:04,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:04,615 INFO L122 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 [2018-11-28 11:52:04,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:04,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:04,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:04,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:04,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:04,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:04,620 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:52:04,624 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:52:04,624 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 11:52:04,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:52:04,625 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:52:04,625 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:52:04,625 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2018-11-28 11:52:04,746 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2018-11-28 11:52:04,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:04,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:04,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:04,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-28 11:52:04,784 INFO L478 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 8 treesize of output 7 [2018-11-28 11:52:04,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:04,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-28 11:52:04,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:04,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2018-11-28 11:52:04,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-28 11:52:04,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:04,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:04,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-28 11:52:04,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:04,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:04,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:62 [2018-11-28 11:52:04,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:04,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-28 11:52:04,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:52:04,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:04,909 INFO L478 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 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-28 11:52:04,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-28 11:52:04,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:04,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:04,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:72 [2018-11-28 11:52:04,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 64 [2018-11-28 11:52:05,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2018-11-28 11:52:05,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:05,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-28 11:52:05,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 11:52:05,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2018-11-28 11:52:05,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:05,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 11:52:05,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 11:52:05,254 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:43, output treesize:149 [2018-11-28 11:52:05,311 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:52:05,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-11-28 11:52:05,315 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-28 11:52:05,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-11-28 11:52:05,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-28 11:52:05,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-11-28 11:52:05,552 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-11-28 11:52:05,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:52:05,698 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:52:05,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-11-28 11:52:05,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 11:52:05,700 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,707 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2018-11-28 11:52:05,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-11-28 11:52:05,778 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:05,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 11:52:05,806 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:05,827 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:05,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-11-28 11:52:05,894 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:193, output treesize:297 [2018-11-28 11:52:06,040 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-11-28 11:52:06,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:06,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-28 11:52:06,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:52:06,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:06,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:06,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:06,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-28 11:52:06,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-28 11:52:06,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:06,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:06,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:06,180 INFO L478 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 0 case distinctions, treesize of input 54 treesize of output 51 [2018-11-28 11:52:06,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2018-11-28 11:52:06,187 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:06,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:06,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:06,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2018-11-28 11:52:06,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-28 11:52:06,263 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:06,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:06,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2018-11-28 11:52:06,293 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:06,312 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:06,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-11-28 11:52:06,360 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:216 [2018-11-28 11:52:06,513 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-11-28 11:52:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:06,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 11:52:06,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-28 11:52:07,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 46 states and 50 transitions. Complement of second has 22 states. [2018-11-28 11:52:07,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-28 11:52:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 11:52:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-28 11:52:07,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2018-11-28 11:52:07,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:52:07,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-28 11:52:07,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:52:07,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2018-11-28 11:52:07,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:52:07,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2018-11-28 11:52:07,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:52:07,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2018-11-28 11:52:07,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 11:52:07,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 11:52:07,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2018-11-28 11:52:07,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:52:07,059 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-28 11:52:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2018-11-28 11:52:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-11-28 11:52:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:52:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 11:52:07,061 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 11:52:07,061 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 11:52:07,062 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:52:07,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-11-28 11:52:07,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:52:07,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:07,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:07,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:52:07,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-11-28 11:52:07,063 INFO L794 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1403#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1404#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1416#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1407#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1408#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1437#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1435#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1418#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1419#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1432#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1430#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1428#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1426#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1424#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1422#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1414#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1410#L24-2 [2018-11-28 11:52:07,063 INFO L796 eck$LassoCheckResult]: Loop: 1410#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1411#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1405#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1406#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1441#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1440#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1417#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1410#L24-2 [2018-11-28 11:52:07,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2018-11-28 11:52:07,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:07,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:07,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:07,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2018-11-28 11:52:07,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:07,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:07,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:07,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:07,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2018-11-28 11:52:07,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:07,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:09,073 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 194 DAG size of output: 155 [2018-11-28 11:52:09,442 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 11:52:09,445 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:52:09,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:52:09,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:52:09,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:52:09,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:52:09,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:52:09,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:52:09,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:52:09,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Lasso [2018-11-28 11:52:09,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:52:09,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:52:09,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:09,815 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-11-28 11:52:10,115 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:52:10,116 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:52:10,116 INFO L122 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 [2018-11-28 11:52:10,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:10,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:10,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:10,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,118 INFO L122 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 [2018-11-28 11:52:10,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:10,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:10,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,120 INFO L122 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 [2018-11-28 11:52:10,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:10,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:10,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:10,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,133 INFO L122 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 [2018-11-28 11:52:10,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:10,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:10,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,136 INFO L122 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 [2018-11-28 11:52:10,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:10,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:10,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:10,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,138 INFO L122 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 [2018-11-28 11:52:10,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:10,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:10,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:10,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,139 INFO L122 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 [2018-11-28 11:52:10,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:10,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:10,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:10,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:10,141 INFO L122 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 [2018-11-28 11:52:10,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:10,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:10,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:10,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:10,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:10,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:52:10,144 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:52:10,147 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:52:10,147 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:52:10,147 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:52:10,148 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:52:10,148 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:52:10,148 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2018-11-28 11:52:10,265 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 11:52:10,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:52:10,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:10,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:10,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:10,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-11-28 11:52:10,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2018-11-28 11:52:10,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 11:52:10,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-28 11:52:10,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:52:10,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:52:10,393 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-11-28 11:52:10,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,414 INFO L478 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 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 11:52:10,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-28 11:52:10,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-11-28 11:52:10,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:52:10,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,465 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:52:10,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:52:10,467 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-28 11:52:10,482 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-11-28 11:52:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:10,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:52:10,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-28 11:52:10,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2018-11-28 11:52:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 11:52:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 11:52:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-28 11:52:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-28 11:52:10,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:52:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-28 11:52:10,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:52:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-28 11:52:10,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:52:10,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2018-11-28 11:52:10,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:52:10,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2018-11-28 11:52:10,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 11:52:10,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 11:52:10,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2018-11-28 11:52:10,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:52:10,582 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-28 11:52:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2018-11-28 11:52:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-28 11:52:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 11:52:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-28 11:52:10,585 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-28 11:52:10,585 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-28 11:52:10,585 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:52:10,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2018-11-28 11:52:10,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:52:10,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:10,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:10,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2018-11-28 11:52:10,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-11-28 11:52:10,587 INFO L794 eck$LassoCheckResult]: Stem: 1779#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1777#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1778#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1810#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1809#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1808#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1807#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1806#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1805#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1791#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1780#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1781#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1801#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1799#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1797#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1786#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1787#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1824#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1782#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1783#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1785#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1792#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1817#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1823#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1822#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1821#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1820#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1819#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1818#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1796#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1788#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1789#L24-2 [2018-11-28 11:52:10,587 INFO L796 eck$LassoCheckResult]: Loop: 1789#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1804#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1803#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1802#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1800#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1798#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1793#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1789#L24-2 [2018-11-28 11:52:10,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2018-11-28 11:52:10,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:10,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:52:10,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:52:10,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20d2211f-ca77-44f5-a1c7-b71c56af576f/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:52:10,755 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:52:10,789 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-28 11:52:10,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:52:10,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:10,792 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:52:10,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:52:10,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:9 [2018-11-28 11:52:10,817 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:52:10,818 INFO L478 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 8 treesize of output 7 [2018-11-28 11:52:10,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 11:52:10,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:52:10,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-28 11:52:10,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-11-28 11:52:10,858 INFO L478 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 11 treesize of output 8 [2018-11-28 11:52:10,859 INFO L478 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 8 treesize of output 7 [2018-11-28 11:52:10,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 11:52:10,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:52:10,879 INFO L478 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 8 treesize of output 7 [2018-11-28 11:52:10,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-28 11:52:10,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-11-28 11:52:10,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-28 11:52:10,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2018-11-28 11:52:10,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 11:52:10,949 INFO L478 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 35 treesize of output 34 [2018-11-28 11:52:10,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-28 11:52:10,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:10,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:11,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:11,005 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:60 [2018-11-28 11:52:11,044 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:52:11,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-11-28 11:52:11,050 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-28 11:52:11,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-11-28 11:52:11,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-28 11:52:11,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-28 11:52:11,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:11,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:11,159 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:78, output treesize:60 [2018-11-28 11:52:11,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 57 [2018-11-28 11:52:11,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-28 11:52:11,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2018-11-28 11:52:11,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:11,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:52:11,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:11,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2018-11-28 11:52:11,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-11-28 11:52:11,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 22 [2018-11-28 11:52:11,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 11:52:11,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 28 [2018-11-28 11:52:11,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 21 [2018-11-28 11:52:11,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 16 [2018-11-28 11:52:11,400 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:52:11,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-28 11:52:11,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 11:52:11,437 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-28 11:52:11,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,448 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,461 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:3 [2018-11-28 11:52:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:52:11,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:52:11,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-11-28 11:52:11,502 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:52:11,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2018-11-28 11:52:11,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:11,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:11,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:11,618 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-28 11:52:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:52:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:52:11,648 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-28 11:52:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:11,864 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-28 11:52:11,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:52:11,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2018-11-28 11:52:11,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:52:11,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-11-28 11:52:11,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:52:11,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:52:11,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:52:11,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:11,866 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:52:11,866 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:52:11,866 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:52:11,866 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:52:11,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:52:11,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:52:11,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:52:11,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:52:11 BoogieIcfgContainer [2018-11-28 11:52:11,872 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:52:11,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:52:11,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:52:11,872 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:52:11,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:53" (3/4) ... [2018-11-28 11:52:11,876 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:52:11,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:52:11,877 INFO L168 Benchmark]: Toolchain (without parser) took 18503.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 952.2 MB in the beginning and 907.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 368.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:11,878 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:52:11,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:11,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.46 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:52:11,880 INFO L168 Benchmark]: Boogie Preprocessor took 50.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:11,880 INFO L168 Benchmark]: RCFGBuilder took 173.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:11,881 INFO L168 Benchmark]: BuchiAutomizer took 18111.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 194.9 MB). Peak memory consumption was 394.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:11,881 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 907.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:52:11,882 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.46 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18111.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 194.9 MB). Peak memory consumption was 394.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 907.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.0s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.8s. Construction of modules took 0.5s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 47 SDtfs, 83 SDslu, 42 SDs, 0 SdLazy, 633 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1982 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...