./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-aa41828 [2018-11-23 02:16:16,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:16:16,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:16:16,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:16:16,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:16:16,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:16:16,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:16:16,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:16:16,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:16:16,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:16:16,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:16:16,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:16:16,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:16:16,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:16:16,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:16:16,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:16:16,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:16:16,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:16:16,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:16:16,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:16:16,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:16:16,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:16:16,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:16:16,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:16:16,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:16:16,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:16:16,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:16:16,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:16:16,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:16:16,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:16:16,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:16:16,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:16:16,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:16:16,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:16:16,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:16:16,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:16:16,723 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 02:16:16,736 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:16:16,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:16:16,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:16:16,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:16:16,738 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:16:16,738 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:16:16,738 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:16:16,738 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:16:16,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:16:16,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:16:16,740 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:16:16,740 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:16:16,740 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:16:16,740 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:16:16,740 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:16:16,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:16:16,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:16:16,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:16:16,741 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:16:16,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:16:16,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:16:16,741 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:16:16,742 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:16:16,742 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_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-23 02:16:16,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:16:16,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:16:16,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:16:16,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:16:16,783 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:16:16,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 02:16:16,829 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/data/ea94dd513/0619a153686a4456be82128eb8cef05f/FLAG1260c2f6a [2018-11-23 02:16:17,189 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:16:17,189 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 02:16:17,194 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/data/ea94dd513/0619a153686a4456be82128eb8cef05f/FLAG1260c2f6a [2018-11-23 02:16:17,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/bin-2019/uautomizer/data/ea94dd513/0619a153686a4456be82128eb8cef05f [2018-11-23 02:16:17,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:16:17,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:16:17,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:16:17,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:16:17,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:16:17,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a557d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17, skipping insertion in model container [2018-11-23 02:16:17,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:16:17,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:16:17,830 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:16:17,841 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:16:17,858 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:16:17,869 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:16:17,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17 WrapperNode [2018-11-23 02:16:17,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:16:17,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:16:17,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:16:17,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:16:17,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:16:17,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:16:17,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:16:17,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:16:17,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... [2018-11-23 02:16:17,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:16:17,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:16:17,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:16:17,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:16:17,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-23 02:16:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:16:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:16:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:16:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:16:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:16:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:16:18,215 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:16:18,215 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 02:16:18,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:18 BoogieIcfgContainer [2018-11-23 02:16:18,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:16:18,216 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:16:18,216 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:16:18,219 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:16:18,220 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:16:18,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:16:17" (1/3) ... [2018-11-23 02:16:18,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@174a8dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:18, skipping insertion in model container [2018-11-23 02:16:18,221 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:16:18,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:17" (2/3) ... [2018-11-23 02:16:18,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@174a8dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:18, skipping insertion in model container [2018-11-23 02:16:18,221 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:16:18,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:18" (3/3) ... [2018-11-23 02:16:18,223 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 02:16:18,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:16:18,263 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:16:18,263 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:16:18,263 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:16:18,263 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:16:18,263 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:16:18,263 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:16:18,263 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:16:18,264 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:16:18,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 02:16:18,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:16:18,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:18,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:18,306 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:16:18,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:16:18,306 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:16:18,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 02:16:18,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:16:18,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:18,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:18,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:16:18,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:16:18,317 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-23 02:16:18,317 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-23 02:16:18,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 02:16:18,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:18,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:18,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:18,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-11-23 02:16:18,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:18,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:18,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:18,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-23 02:16:18,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:19,100 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-11-23 02:16:19,292 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 02:16:19,310 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:16:19,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:16:19,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:16:19,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:16:19,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:16:19,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:16:19,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:16:19,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:16:19,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-11-23 02:16:19,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:16:19,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:16:19,336 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-23 02:16:19,343 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-23 02:16:19,348 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-23 02:16:19,352 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-23 02:16:19,357 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-23 02:16:19,362 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-23 02:16:19,365 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-23 02:16:19,371 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-23 02:16:19,804 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-11-23 02:16:19,919 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-11-23 02:16:19,919 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-23 02:16:19,921 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-23 02:16:20,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:16:20,337 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:16:20,339 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-23 02:16:20,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:20,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:20,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:20,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,345 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-23 02:16:20,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,353 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-23 02:16:20,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,360 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-23 02:16:20,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:20,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:20,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:20,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,364 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-23 02:16:20,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,373 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-23 02:16:20,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,382 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-23 02:16:20,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:20,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:20,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:20,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,385 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-23 02:16:20,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,388 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:16:20,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,390 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:16:20,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,403 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-23 02:16:20,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,426 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-23 02:16:20,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,433 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-23 02:16:20,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,440 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-23 02:16:20,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,449 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-23 02:16:20,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,483 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-23 02:16:20,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,484 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:16:20,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,488 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:16:20,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,495 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-23 02:16:20,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,500 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-23 02:16:20,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,505 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-23 02:16:20,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,512 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-23 02:16:20,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,520 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-23 02:16:20,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,525 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-23 02:16:20,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,526 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:16:20,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,527 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:16:20,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,533 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-23 02:16:20,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:20,538 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-23 02:16:20,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:20,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:20,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:20,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:20,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:20,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:20,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:16:20,550 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:16:20,550 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:16:20,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:16:20,553 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:16:20,553 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:16:20,554 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-23 02:16:20,654 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-23 02:16:20,660 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:16:20,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:20,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:20,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:20,717 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-23 02:16:20,726 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-23 02:16:20,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-11-23 02:16:20,754 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-23 02:16:20,755 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-23 02:16:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:16:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-23 02:16:20,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-23 02:16:20,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:20,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 02:16:20,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:20,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 02:16:20,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:20,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-11-23 02:16:20,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:16:20,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2018-11-23 02:16:20,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 02:16:20,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:16:20,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-11-23 02:16:20,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:20,764 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:16:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-11-23 02:16:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 02:16:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:16:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-23 02:16:20,781 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:16:20,781 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:16:20,781 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:16:20,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-23 02:16:20,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:16:20,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:20,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:20,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:16:20,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:16:20,782 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-23 02:16:20,782 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-23 02:16:20,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-23 02:16:20,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:20,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:20,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:20,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:20,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:20,884 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-23 02:16:20,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:16:20,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:16:20,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:16:20,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2018-11-23 02:16:20,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:20,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:16:20,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:16:20,957 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 02:16:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:21,011 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-23 02:16:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:16:21,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-23 02:16:21,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:16:21,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2018-11-23 02:16:21,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:16:21,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:16:21,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 02:16:21,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:21,014 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 02:16:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 02:16:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-23 02:16:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:16:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 02:16:21,015 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 02:16:21,015 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 02:16:21,015 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:16:21,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 02:16:21,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:16:21,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:21,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:21,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 02:16:21,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:16:21,016 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-23 02:16:21,016 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-23 02:16:21,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:21,017 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-11-23 02:16:21,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:21,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2018-11-23 02:16:21,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:21,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:21,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:21,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2018-11-23 02:16:21,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:21,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:21,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:21,104 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-23 02:16:21,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:16:21,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-23 02:16:21,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:21,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:21,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:21,158 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-23 02:16:21,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:21,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:21,183 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-23 02:16:21,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,191 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-23 02:16:21,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-11-23 02:16:21,195 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-23 02:16:21,196 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-23 02:16:21,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-23 02:16:21,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:21,217 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-23 02:16:21,220 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-23 02:16:21,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 02:16:21,240 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-23 02:16:21,241 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-23 02:16:21,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,248 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-23 02:16:21,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-11-23 02:16:21,274 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-23 02:16:21,276 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-23 02:16:21,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,280 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-23 02:16:21,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:21,284 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-23 02:16:21,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 02:16:21,289 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-23 02:16:21,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:16:21,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 02:16:21,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:16:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:16:21,359 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2018-11-23 02:16:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:21,474 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 02:16:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:16:21,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-23 02:16:21,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:16:21,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-11-23 02:16:21,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 02:16:21,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 02:16:21,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-23 02:16:21,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:16:21,475 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 02:16:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-23 02:16:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-11-23 02:16:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:16:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 02:16:21,476 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 02:16:21,476 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 02:16:21,476 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:16:21,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-23 02:16:21,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:16:21,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:21,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:21,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:16:21,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-11-23 02:16:21,477 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-23 02:16:21,477 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-23 02:16:21,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 02:16:21,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:21,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2018-11-23 02:16:21,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:21,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:21,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:21,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2018-11-23 02:16:21,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:21,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:21,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:21,620 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-23 02:16:21,878 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-23 02:16:21,995 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-23 02:16:21,997 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:16:21,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:16:21,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:16:21,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:16:21,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:16:21,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:16:21,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:16:21,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:16:21,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-11-23 02:16:21,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:16:21,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:16:22,000 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-23 02:16:22,001 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-23 02:16:22,236 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2018-11-23 02:16:22,335 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-23 02:16:22,337 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-23 02:16:22,338 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-23 02:16:22,339 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-23 02:16:22,341 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-23 02:16:22,342 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-23 02:16:22,343 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-23 02:16:22,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:16:22,661 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:16:22,661 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-23 02:16:22,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:22,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:22,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:22,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:22,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:22,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:22,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:22,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:22,663 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-23 02:16:22,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:22,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:22,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:22,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:22,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:22,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:22,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:22,668 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-23 02:16:22,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:22,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:22,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:22,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:22,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:22,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:22,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:22,673 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-23 02:16:22,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:22,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:22,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:22,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:22,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:22,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:22,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:22,681 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-23 02:16:22,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:22,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:22,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:22,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:22,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:22,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:22,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:16:22,692 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:16:22,692 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:16:22,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:16:22,693 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:16:22,693 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:16:22,693 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-23 02:16:22,823 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-23 02:16:22,825 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:16:22,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:22,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:22,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:22,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:22,889 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-23 02:16:22,894 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-23 02:16:22,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:22,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:22,931 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-23 02:16:22,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 02:16:22,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:16:22,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:16:22,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-11-23 02:16:23,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,028 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-23 02:16:23,034 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-23 02:16:23,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,072 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-23 02:16:23,087 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-23 02:16:23,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,149 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-23 02:16:23,153 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-23 02:16:23,153 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,191 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-23 02:16:23,191 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-11-23 02:16:23,271 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-23 02:16:23,271 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-23 02:16:23,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-23 02:16:23,380 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-23 02:16:23,381 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-23 02:16:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:16:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-23 02:16:23,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-23 02:16:23,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:23,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-23 02:16:23,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:23,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-23 02:16:23,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:23,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-23 02:16:23,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:16:23,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 02:16:23,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 02:16:23,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 02:16:23,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-23 02:16:23,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:23,383 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 02:16:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-23 02:16:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 02:16:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 02:16:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 02:16:23,385 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 02:16:23,385 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 02:16:23,386 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:16:23,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-23 02:16:23,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:16:23,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:23,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:23,387 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 02:16:23,387 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:16:23,387 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-23 02:16:23,387 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-23 02:16:23,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2018-11-23 02:16:23,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:23,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:23,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:23,557 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-23 02:16:23,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:16:23,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-23 02:16:23,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:23,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:23,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,612 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-23 02:16:23,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,631 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-23 02:16:23,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,655 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-23 02:16:23,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,698 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-23 02:16:23,701 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-23 02:16:23,701 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,712 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-23 02:16:23,715 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-23 02:16:23,715 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,729 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-23 02:16:23,732 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-23 02:16:23,732 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,760 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-23 02:16:23,762 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-23 02:16:23,763 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,773 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,778 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-23 02:16:23,783 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-23 02:16:23,788 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-23 02:16:23,799 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-23 02:16:23,799 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2018-11-23 02:16:23,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:23,831 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-23 02:16:23,833 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-23 02:16:23,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,851 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-23 02:16:23,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2018-11-23 02:16:23,918 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-23 02:16:23,926 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-23 02:16:23,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,937 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-23 02:16:23,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,943 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-23 02:16:23,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,947 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-23 02:16:23,947 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:23,955 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-23 02:16:23,955 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:76, output treesize:3 [2018-11-23 02:16:23,963 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-23 02:16:23,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:16:23,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-23 02:16:23,986 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:16:23,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2018-11-23 02:16:23,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:23,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:23,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:16:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:16:24,108 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-23 02:16:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:24,304 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 02:16:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:16:24,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-11-23 02:16:24,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:16:24,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-11-23 02:16:24,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 02:16:24,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 02:16:24,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-11-23 02:16:24,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:24,307 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 02:16:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-11-23 02:16:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-11-23 02:16:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 02:16:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 02:16:24,309 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 02:16:24,309 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 02:16:24,309 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:16:24,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 02:16:24,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:16:24,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:24,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:24,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-23 02:16:24,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:16:24,311 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-23 02:16:24,312 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-23 02:16:24,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2018-11-23 02:16:24,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:24,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:24,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:24,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2018-11-23 02:16:24,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:24,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:24,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:24,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:24,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:24,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2018-11-23 02:16:24,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:24,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:24,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:24,440 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-23 02:16:24,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:16:24,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-23 02:16:24,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:24,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:24,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:24,503 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-23 02:16:24,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:24,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:24,524 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-23 02:16:24,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-23 02:16:24,541 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-23 02:16:24,543 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-23 02:16:24,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-23 02:16:24,589 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-23 02:16:24,591 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-23 02:16:24,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-11-23 02:16:24,636 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-23 02:16:24,639 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-23 02:16:24,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-23 02:16:24,674 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-23 02:16:24,677 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-23 02:16:24,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,692 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-23 02:16:24,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-11-23 02:16:24,724 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-23 02:16:24,727 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-23 02:16:24,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,732 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-23 02:16:24,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:24,738 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-23 02:16:24,738 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2018-11-23 02:16:24,747 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-23 02:16:24,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:16:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-23 02:16:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:16:24,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:16:24,894 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-11-23 02:16:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:25,228 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 02:16:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:16:25,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2018-11-23 02:16:25,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-23 02:16:25,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 02:16:25,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 02:16:25,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 02:16:25,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2018-11-23 02:16:25,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:25,230 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 02:16:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2018-11-23 02:16:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-23 02:16:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:16:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 02:16:25,232 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 02:16:25,232 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 02:16:25,233 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:16:25,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-11-23 02:16:25,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-23 02:16:25,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:25,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:25,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-23 02:16:25,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:16:25,234 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-23 02:16:25,235 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-23 02:16:25,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2018-11-23 02:16:25,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:25,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:25,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:25,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 53784836, now seen corresponding path program 1 times [2018-11-23 02:16:25,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:25,295 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-23 02:16:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:16:25,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:16:25,296 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:16:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:16:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:16:25,296 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 02:16:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:25,332 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 02:16:25,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:16:25,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-23 02:16:25,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 02:16:25,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2018-11-23 02:16:25,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 02:16:25,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 02:16:25,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-23 02:16:25,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:25,334 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 02:16:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-23 02:16:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 02:16:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 02:16:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 02:16:25,335 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 02:16:25,335 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 02:16:25,336 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:16:25,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-11-23 02:16:25,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 02:16:25,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:25,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:25,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-23 02:16:25,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2018-11-23 02:16:25,337 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-23 02:16:25,337 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-23 02:16:25,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2018-11-23 02:16:25,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2018-11-23 02:16:25,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2018-11-23 02:16:25,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:26,010 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2018-11-23 02:16:26,178 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-23 02:16:28,273 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 189 DAG size of output: 149 [2018-11-23 02:16:28,649 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-23 02:16:28,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:16:28,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:16:28,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:16:28,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:16:28,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:16:28,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:16:28,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:16:28,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:16:28,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Lasso [2018-11-23 02:16:28,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:16:28,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:16:28,656 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-23 02:16:28,660 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-23 02:16:28,662 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-23 02:16:28,663 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-23 02:16:28,664 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-23 02:16:29,174 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-11-23 02:16:29,304 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-23 02:16:29,304 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-23 02:16:29,306 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-23 02:16:29,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:16:29,666 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:16:29,666 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-23 02:16:29,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:29,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:29,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:29,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,668 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-23 02:16:29,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,678 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-23 02:16:29,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:29,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:29,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:29,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,680 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-23 02:16:29,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:29,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:29,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:29,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,682 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-23 02:16:29,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,682 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:16:29,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,683 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:16:29,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,687 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-23 02:16:29,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,692 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-23 02:16:29,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,692 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:16:29,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,693 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:16:29,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,697 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-23 02:16:29,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,697 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:16:29,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:16:29,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,702 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-23 02:16:29,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,705 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-23 02:16:29,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,710 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-23 02:16:29,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,715 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-23 02:16:29,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,718 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-23 02:16:29,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,721 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-23 02:16:29,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:29,738 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-23 02:16:29,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:29,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:29,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:29,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:29,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:29,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:29,744 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:16:29,750 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:16:29,750 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 02:16:29,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:16:29,751 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:16:29,752 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:16:29,752 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-23 02:16:29,901 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2018-11-23 02:16:29,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:29,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:29,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:29,953 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-23 02:16:29,955 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-23 02:16:29,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:29,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:29,961 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-23 02:16:29,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-23 02:16:29,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:29,996 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-23 02:16:29,999 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-23 02:16:29,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,016 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-23 02:16:30,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:30,049 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-23 02:16:30,049 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:62 [2018-11-23 02:16:30,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,099 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-23 02:16:30,101 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-23 02:16:30,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,144 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-23 02:16:30,148 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-23 02:16:30,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,182 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-23 02:16:30,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:72 [2018-11-23 02:16:30,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,272 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-23 02:16:30,285 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-23 02:16:30,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 02:16:30,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,391 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-23 02:16:30,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,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 33 treesize of output 41 [2018-11-23 02:16:30,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,490 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-23 02:16:30,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 02:16:30,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 02:16:30,574 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-23 02:16:30,575 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:43, output treesize:149 [2018-11-23 02:16:30,663 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:16:30,666 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-23 02:16:30,669 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-23 02:16:30,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,781 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-23 02:16:30,786 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-23 02:16:30,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:30,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:30,974 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-23 02:16:30,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,032 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-23 02:16:31,033 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:16:31,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:16:31,165 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-23 02:16:31,169 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-23 02:16:31,169 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,186 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,285 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-23 02:16:31,288 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-23 02:16:31,289 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,343 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-23 02:16:31,343 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,370 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:31,455 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-23 02:16:31,455 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:193, output treesize:297 [2018-11-23 02:16:31,652 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-11-23 02:16:31,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,671 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-23 02:16:31,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, 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-23 02:16:31,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,761 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-23 02:16:31,763 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-23 02:16:31,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,831 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-23 02:16:31,839 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-23 02:16:31,839 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 02:16:31,859 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:31,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,935 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-23 02:16:31,938 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-23 02:16:31,938 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:31,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:31,976 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-23 02:16:31,977 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 02:16:32,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:32,063 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-23 02:16:32,063 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:216 [2018-11-23 02:16:32,260 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-11-23 02:16:32,261 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-23 02:16:32,262 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-23 02:16:32,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-23 02:16:32,760 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2018-11-23 02:16:32,869 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-23 02:16:32,869 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-23 02:16:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 02:16:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-23 02:16:32,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2018-11-23 02:16:32,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:32,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-23 02:16:32,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:32,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2018-11-23 02:16:32,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:32,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2018-11-23 02:16:32,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:16:32,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 02:16:32,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 02:16:32,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 02:16:32,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2018-11-23 02:16:32,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:32,874 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 02:16:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2018-11-23 02:16:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-11-23 02:16:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 02:16:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 02:16:32,878 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 02:16:32,878 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 02:16:32,878 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 02:16:32,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-11-23 02:16:32,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:16:32,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:32,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:32,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 02:16:32,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-11-23 02:16:32,879 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-23 02:16:32,879 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-23 02:16:32,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2018-11-23 02:16:32,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:32,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:32,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:32,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2018-11-23 02:16:32,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:32,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:32,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:32,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:32,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2018-11-23 02:16:32,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:32,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:32,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:33,066 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-23 02:16:35,654 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 194 DAG size of output: 150 [2018-11-23 02:16:35,949 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-23 02:16:35,952 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:16:35,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:16:35,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:16:35,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:16:35,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:16:35,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:16:35,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:16:35,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:16:35,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Lasso [2018-11-23 02:16:35,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:16:35,953 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:16:35,955 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-23 02:16:35,957 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-23 02:16:35,958 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-23 02:16:35,959 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-23 02:16:36,327 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 02:16:36,403 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-23 02:16:36,404 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-23 02:16:36,405 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-23 02:16:36,407 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-23 02:16:36,684 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:16:36,684 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:16:36,685 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-23 02:16:36,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:36,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:36,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:36,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:36,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:36,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:36,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:36,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:36,686 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-23 02:16:36,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:36,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:36,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:36,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:36,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:36,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:36,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:36,687 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-23 02:16:36,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:36,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:16:36,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:36,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:36,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:36,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:16:36,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:16:36,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:16:36,688 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-23 02:16:36,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:16:36,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:16:36,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:16:36,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:16:36,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:16:36,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:16:36,691 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:16:36,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:16:36,692 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:16:36,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:16:36,693 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:16:36,693 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:16:36,693 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-23 02:16:36,783 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-23 02:16:36,784 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:16:36,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:36,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:36,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:36,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:36,830 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-23 02:16:36,840 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-23 02:16:36,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 02:16:36,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:36,866 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-23 02:16:36,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:16:36,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:16:36,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-11-23 02:16:36,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:36,920 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-23 02:16:36,924 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-23 02:16:36,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:36,950 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-23 02:16:36,952 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-23 02:16:36,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:36,972 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-23 02:16:36,974 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-23 02:16:36,974 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,977 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:36,989 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-23 02:16:36,990 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-11-23 02:16:37,015 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-23 02:16:37,016 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-23 02:16:37,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-23 02:16:37,089 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-23 02:16:37,090 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-23 02:16:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:16:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-23 02:16:37,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-23 02:16:37,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:37,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-23 02:16:37,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:37,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-23 02:16:37,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:16:37,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2018-11-23 02:16:37,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:16:37,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2018-11-23 02:16:37,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:16:37,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:16:37,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2018-11-23 02:16:37,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:16:37,094 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 02:16:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2018-11-23 02:16:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-23 02:16:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 02:16:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-23 02:16:37,097 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 02:16:37,097 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 02:16:37,097 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 02:16:37,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2018-11-23 02:16:37,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:16:37,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:16:37,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:16:37,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2018-11-23 02:16:37,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-11-23 02:16:37,098 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-23 02:16:37,099 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-23 02:16:37,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2018-11-23 02:16:37,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:37,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:37,268 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-23 02:16:37,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:16:37,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52a01ac0-a490-476d-8307-d9da08f0ea9b/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-23 02:16:37,276 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:16:37,312 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 02:16:37,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:16:37,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:37,318 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-23 02:16:37,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,348 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-23 02:16:37,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:9 [2018-11-23 02:16:37,368 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-23 02:16:37,371 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-23 02:16:37,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 02:16:37,391 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-23 02:16:37,393 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-23 02:16:37,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-11-23 02:16:37,408 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-23 02:16:37,409 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-23 02:16:37,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 02:16:37,426 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-23 02:16:37,428 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-23 02:16:37,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 02:16:37,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,452 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-23 02:16:37,454 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-23 02:16:37,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2018-11-23 02:16:37,498 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-23 02:16:37,500 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-23 02:16:37,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,530 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-23 02:16:37,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,557 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:60 [2018-11-23 02:16:37,598 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:16:37,600 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-23 02:16:37,602 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-23 02:16:37,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,636 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-23 02:16:37,639 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-23 02:16:37,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,672 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-23 02:16:37,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,707 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:78, output treesize:60 [2018-11-23 02:16:37,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,744 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-23 02:16:37,746 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-23 02:16:37,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,770 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-23 02:16:37,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:16:37,798 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-23 02:16:37,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2018-11-23 02:16:37,861 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-23 02:16:37,863 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-23 02:16:37,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:16:37,882 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-23 02:16:37,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,902 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-23 02:16:37,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,916 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-23 02:16:37,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,929 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-23 02:16:37,929 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:16:37,987 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-23 02:16:37,989 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-23 02:16:37,989 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:37,996 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-23 02:16:37,996 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:16:38,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:16:38,009 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-23 02:16:38,009 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:3 [2018-11-23 02:16:38,026 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-23 02:16:38,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:16:38,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-11-23 02:16:38,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:16:38,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2018-11-23 02:16:38,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:38,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:38,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:16:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:38,245 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-23 02:16:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:16:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:16:38,279 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-23 02:16:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:38,499 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 02:16:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 02:16:38,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2018-11-23 02:16:38,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:16:38,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-11-23 02:16:38,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:16:38,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:16:38,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:16:38,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:16:38,500 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:16:38,500 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:16:38,500 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:16:38,500 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 02:16:38,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:16:38,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:16:38,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:16:38,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:16:38 BoogieIcfgContainer [2018-11-23 02:16:38,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:16:38,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:16:38,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:16:38,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:16:38,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:18" (3/4) ... [2018-11-23 02:16:38,508 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:16:38,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:16:38,508 INFO L168 Benchmark]: Toolchain (without parser) took 20891.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 955.7 MB in the beginning and 1.4 GB in the end (delta: -399.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:38,509 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:16:38,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.18 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 944.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:38,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.77 ms. Allocated memory is still 1.0 GB. Free memory was 944.9 MB in the beginning and 939.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:38,509 INFO L168 Benchmark]: Boogie Preprocessor took 17.63 ms. Allocated memory is still 1.0 GB. Free memory is still 939.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:16:38,509 INFO L168 Benchmark]: RCFGBuilder took 297.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:38,510 INFO L168 Benchmark]: BuchiAutomizer took 20288.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -207.3 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:38,510 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:16:38,512 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.18 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 944.9 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 29.77 ms. Allocated memory is still 1.0 GB. Free memory was 944.9 MB in the beginning and 939.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.63 ms. Allocated memory is still 1.0 GB. Free memory is still 939.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 297.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20288.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -207.3 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. 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 20.2s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 15.2s. Construction of modules took 0.5s. Büchi inclusion checks took 4.3s. 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: inital1974 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp40 div100 bol100 ite100 ukn100 eq191 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms 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...