./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/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 32bit --witnessprinter.graph.data.programhash 986c31897144a5b76f321e97eaa1d3383cce25ed ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:16:48,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:16:48,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:16:48,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:16:48,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:16:48,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:16:48,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:16:48,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:16:48,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:16:48,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:16:48,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:16:48,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:16:48,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:16:48,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:16:48,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:16:48,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:16:48,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:16:48,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:16:48,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:16:48,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:16:48,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:16:48,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:16:48,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:16:48,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:16:48,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:16:48,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:16:48,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:16:48,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:16:48,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:16:48,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:16:48,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:16:48,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:16:48,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:16:48,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:16:48,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:16:48,825 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:16:48,825 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 23:16:48,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:16:48,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:16:48,836 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:16:48,836 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:16:48,836 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:16:48,836 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 23:16:48,836 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 23:16:48,836 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 23:16:48,836 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 23:16:48,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 23:16:48,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 23:16:48,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 23:16:48,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:16:48,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:16:48,839 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 23:16:48,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:16:48,839 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:16:48,839 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 23:16:48,840 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 23:16:48,840 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_e095db53-5774-4e21-a99b-cb6faa8b2892/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2018-11-09 23:16:48,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:16:48,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:16:48,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:16:48,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:16:48,873 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:16:48,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-09 23:16:48,907 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/data/e8256f77d/641135936e904dd9bd0f1f60839c5bd6/FLAGf01917b4b [2018-11-09 23:16:49,344 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:16:49,345 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-09 23:16:49,355 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/data/e8256f77d/641135936e904dd9bd0f1f60839c5bd6/FLAGf01917b4b [2018-11-09 23:16:49,365 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/bin-2019/uautomizer/data/e8256f77d/641135936e904dd9bd0f1f60839c5bd6 [2018-11-09 23:16:49,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:16:49,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 23:16:49,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:16:49,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:16:49,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:16:49,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458aae2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49, skipping insertion in model container [2018-11-09 23:16:49,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:16:49,405 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:16:49,579 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:16:49,586 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:16:49,615 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:16:49,636 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:16:49,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49 WrapperNode [2018-11-09 23:16:49,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:16:49,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 23:16:49,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 23:16:49,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 23:16:49,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 23:16:49,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:16:49,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:16:49,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:16:49,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... [2018-11-09 23:16:49,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:16:49,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:16:49,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:16:49,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:16:49,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e095db53-5774-4e21-a99b-cb6faa8b2892/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-09 23:16:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 23:16:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 23:16:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:16:49,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:16:49,944 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:16:49,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:16:49 BoogieIcfgContainer [2018-11-09 23:16:49,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:16:49,945 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 23:16:49,945 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 23:16:49,948 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 23:16:49,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:16:49,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 11:16:49" (1/3) ... [2018-11-09 23:16:49,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce4ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:16:49, skipping insertion in model container [2018-11-09 23:16:49,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:16:49,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:49" (2/3) ... [2018-11-09 23:16:49,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce4ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:16:49, skipping insertion in model container [2018-11-09 23:16:49,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:16:49,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:16:49" (3/3) ... [2018-11-09 23:16:49,951 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-11-09 23:16:49,982 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:16:49,982 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 23:16:49,982 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 23:16:49,982 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 23:16:49,982 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:16:49,982 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:16:49,983 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 23:16:49,983 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:16:49,983 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 23:16:49,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-09 23:16:50,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-09 23:16:50,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:50,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:50,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,010 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 23:16:50,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-09 23:16:50,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-09 23:16:50,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:50,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:50,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,018 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 14#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 3#L570-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 13#L547-3true [2018-11-09 23:16:50,018 INFO L795 eck$LassoCheckResult]: Loop: 13#L547-3true assume true; 8#L547-1true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L551-4true assume !true; 6#L550-3true assume !(diff_~found~0 == 0); 10#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 13#L547-3true [2018-11-09 23:16:50,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,023 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-09 23:16:50,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash 46965800, now seen corresponding path program 1 times [2018-11-09 23:16:50,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:50,132 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-09 23:16:50,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:16:50,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:16:50,135 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:16:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 23:16:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 23:16:50,145 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-09 23:16:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:16:50,150 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-09 23:16:50,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 23:16:50,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-09 23:16:50,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-09 23:16:50,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 22 transitions. [2018-11-09 23:16:50,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-09 23:16:50,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-09 23:16:50,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-09 23:16:50,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:16:50,156 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-09 23:16:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-09 23:16:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-09 23:16:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-09 23:16:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-09 23:16:50,172 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-09 23:16:50,172 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-09 23:16:50,172 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 23:16:50,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-09 23:16:50,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-09 23:16:50,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:50,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:50,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 23:16:50,173 INFO L793 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 60#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 61#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 50#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 51#L547-3 [2018-11-09 23:16:50,173 INFO L795 eck$LassoCheckResult]: Loop: 51#L547-3 assume true; 59#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 54#L551-4 assume true; 55#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 56#L550-3 assume !(diff_~found~0 == 0); 57#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 51#L547-3 [2018-11-09 23:16:50,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-09 23:16:50,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442957, now seen corresponding path program 1 times [2018-11-09 23:16:50,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:50,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:50,213 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-09 23:16:50,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:16:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:16:50,213 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:16:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:16:50,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:16:50,214 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-09 23:16:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:16:50,235 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-09 23:16:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:16:50,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-11-09 23:16:50,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-09 23:16:50,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2018-11-09 23:16:50,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-09 23:16:50,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-09 23:16:50,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-09 23:16:50,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:16:50,237 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-09 23:16:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-09 23:16:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-09 23:16:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-09 23:16:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-09 23:16:50,239 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-09 23:16:50,239 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-09 23:16:50,239 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 23:16:50,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-09 23:16:50,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-09 23:16:50,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:50,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:50,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:16:50,241 INFO L793 eck$LassoCheckResult]: Stem: 109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 105#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 106#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 96#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 97#L547-3 [2018-11-09 23:16:50,241 INFO L795 eck$LassoCheckResult]: Loop: 97#L547-3 assume true; 104#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 100#L551-4 assume true; 101#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 102#L550-3 assume diff_~found~0 == 0; 98#L558 SUMMARY for call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 99#L558-1 SUMMARY for call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + diff_~k~0 * 4, 4); srcloc: L558-1 103#L558-2 havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := diff_#t~post6 + 1;havoc diff_#t~post6; 107#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 97#L547-3 [2018-11-09 23:16:50,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-09 23:16:50,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1401533195, now seen corresponding path program 1 times [2018-11-09 23:16:50,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1410862234, now seen corresponding path program 1 times [2018-11-09 23:16:50,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:50,358 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-09 23:16:50,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:16:50,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:16:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 23:16:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:16:50,484 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-09 23:16:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:16:50,517 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-09 23:16:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:16:50,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-09 23:16:50,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-09 23:16:50,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-11-09 23:16:50,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-09 23:16:50,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-09 23:16:50,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-09 23:16:50,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:16:50,520 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-09 23:16:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-09 23:16:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-09 23:16:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-09 23:16:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-09 23:16:50,521 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-09 23:16:50,522 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-09 23:16:50,522 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 23:16:50,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-09 23:16:50,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-09 23:16:50,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:50,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:50,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:50,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:16:50,523 INFO L793 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 164#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 165#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 155#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 156#L547-3 [2018-11-09 23:16:50,523 INFO L795 eck$LassoCheckResult]: Loop: 156#L547-3 assume true; 163#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 159#L551-4 assume true; 160#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 169#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 170#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 171#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 172#L551-4 assume true; 175#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 174#L550-3 assume !(diff_~found~0 == 0); 166#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 156#L547-3 [2018-11-09 23:16:50,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-09 23:16:50,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1591366400, now seen corresponding path program 1 times [2018-11-09 23:16:50,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1526022811, now seen corresponding path program 1 times [2018-11-09 23:16:50,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:50,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:50,802 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-09 23:16:50,932 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-09 23:16:50,940 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:16:50,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:16:50,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:16:50,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:16:50,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:16:50,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:16:50,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:16:50,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:16:50,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-09 23:16:50,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:16:50,942 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:16:50,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-09 23:16:50,961 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-09 23:16:50,962 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-09 23:16:50,964 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-09 23:16:50,965 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-09 23:16:50,971 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-09 23:16:50,972 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-09 23:16:50,974 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-09 23:16:50,976 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-09 23:16:50,977 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-09 23:16:51,314 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-11-09 23:16:51,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-09 23:16:51,359 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-09 23:16:51,361 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-09 23:16:51,363 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-09 23:16:51,368 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-09 23:16:51,811 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:16:51,815 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:16:51,816 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-09 23:16:51,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:51,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:51,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:51,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,821 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-09 23:16:51,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:51,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:51,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:51,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,824 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-09 23:16:51,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,829 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-09 23:16:51,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,834 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-09 23:16:51,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,843 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-09 23:16:51,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:51,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:51,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:51,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,845 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-09 23:16:51,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,850 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-09 23:16:51,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:51,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:51,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:51,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,853 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-09 23:16:51,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:51,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:51,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:51,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,855 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-09 23:16:51,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,859 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-09 23:16:51,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:51,864 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-09 23:16:51,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:51,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:51,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:51,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:51,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:51,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:51,897 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:16:51,922 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-09 23:16:51,922 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-09 23:16:51,924 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:16:51,925 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:16:51,926 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:16:51,926 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2018-11-09 23:16:51,978 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-09 23:16:51,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:52,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:52,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-09 23:16:52,033 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-09 23:16:52,034 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-09 23:16:52,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-11-09 23:16:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-09 23:16:52,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 11 letters. [2018-11-09 23:16:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:52,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 11 letters. [2018-11-09 23:16:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:52,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-09 23:16:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:52,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-09 23:16:52,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-09 23:16:52,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 33 states and 42 transitions. [2018-11-09 23:16:52,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-09 23:16:52,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-09 23:16:52,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2018-11-09 23:16:52,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:16:52,061 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-09 23:16:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2018-11-09 23:16:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-09 23:16:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-09 23:16:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-09 23:16:52,064 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-09 23:16:52,064 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-09 23:16:52,064 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 23:16:52,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-09 23:16:52,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-09 23:16:52,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:52,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:52,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:16:52,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:52,065 INFO L793 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 360#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 361#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 347#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 348#L547-3 assume true; 357#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 351#L551-4 [2018-11-09 23:16:52,065 INFO L795 eck$LassoCheckResult]: Loop: 351#L551-4 assume true; 352#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 366#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 367#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 370#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 351#L551-4 [2018-11-09 23:16:52,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935596, now seen corresponding path program 1 times [2018-11-09 23:16:52,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:52,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:52,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:52,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 56489728, now seen corresponding path program 1 times [2018-11-09 23:16:52,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:52,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:52,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:52,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2103604149, now seen corresponding path program 1 times [2018-11-09 23:16:52,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:52,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:52,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:52,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:52,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:52,374 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 123 [2018-11-09 23:16:52,484 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-09 23:16:52,486 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:16:52,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:16:52,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:16:52,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:16:52,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:16:52,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:16:52,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:16:52,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:16:52,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-09 23:16:52,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:16:52,487 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:16:52,491 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-09 23:16:52,494 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-09 23:16:52,495 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-09 23:16:52,497 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-09 23:16:52,498 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-09 23:16:52,503 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-09 23:16:52,504 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-09 23:16:52,505 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-09 23:16:52,507 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-09 23:16:52,509 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-09 23:16:52,803 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 122 [2018-11-09 23:16:52,861 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-09 23:16:52,862 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-09 23:16:52,863 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-09 23:16:52,865 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-09 23:16:52,866 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-09 23:16:53,281 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-09 23:16:53,302 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:16:53,302 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:16:53,302 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-09 23:16:53,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:53,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:53,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:53,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:53,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:53,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:53,310 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:16:53,311 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 23:16:53,311 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:16:53,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:16:53,312 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:16:53,312 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:16:53,312 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-09 23:16:53,347 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-09 23:16:53,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:53,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:53,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:53,399 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-09 23:16:53,399 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-09 23:16:53,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-09 23:16:53,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 91 states and 114 transitions. Complement of second has 7 states. [2018-11-09 23:16:53,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-09 23:16:53,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-09 23:16:53,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:53,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-09 23:16:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:53,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-09 23:16:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:53,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 114 transitions. [2018-11-09 23:16:53,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:16:53,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 110 transitions. [2018-11-09 23:16:53,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-09 23:16:53,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-09 23:16:53,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-09 23:16:53,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:16:53,443 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-09 23:16:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-09 23:16:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-11-09 23:16:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-09 23:16:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-09 23:16:53,448 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-09 23:16:53,448 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-09 23:16:53,448 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 23:16:53,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 98 transitions. [2018-11-09 23:16:53,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:16:53,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:53,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:53,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:16:53,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:53,450 INFO L793 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 607#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 608#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 592#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 593#L547-3 assume true; 612#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 634#L551-4 assume true; 597#L550-1 [2018-11-09 23:16:53,450 INFO L795 eck$LassoCheckResult]: Loop: 597#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 617#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 618#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 624#L551-2 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := diff_#t~post4 + 1;havoc diff_#t~post4; 596#L551-4 assume true; 597#L550-1 [2018-11-09 23:16:53,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash 180428657, now seen corresponding path program 1 times [2018-11-09 23:16:53,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:53,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:53,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash 62061750, now seen corresponding path program 1 times [2018-11-09 23:16:53,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:53,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:53,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:53,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:53,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash 787219270, now seen corresponding path program 1 times [2018-11-09 23:16:53,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:53,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:53,779 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2018-11-09 23:16:53,902 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-09 23:16:53,903 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:16:53,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:16:53,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:16:53,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:16:53,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:16:53,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:16:53,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:16:53,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:16:53,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-09 23:16:53,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:16:53,904 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:16:53,906 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-09 23:16:53,907 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-09 23:16:53,912 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-09 23:16:53,913 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-09 23:16:53,914 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-09 23:16:53,915 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-09 23:16:53,916 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-09 23:16:53,917 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-09 23:16:54,183 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-11-09 23:16:54,212 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-09 23:16:54,213 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-09 23:16:54,214 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-09 23:16:54,215 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-09 23:16:54,216 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-09 23:16:54,218 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-09 23:16:54,219 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-09 23:16:54,589 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:16:54,589 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:16:54,590 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-09 23:16:54,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:54,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:54,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:54,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,591 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-09 23:16:54,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,599 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-09 23:16:54,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,602 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-09 23:16:54,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:54,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:54,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:54,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,603 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-09 23:16:54,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,606 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-09 23:16:54,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:54,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:54,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:54,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,607 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-09 23:16:54,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:54,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:54,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:54,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,614 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-09 23:16:54,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,614 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:16:54,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,616 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:16:54,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:16:54,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,620 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:16:54,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:16:54,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,630 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-09 23:16:54,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:16:54,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,649 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-09 23:16:54,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:54,656 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-09 23:16:54,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:54,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:54,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:54,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:54,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:54,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:54,684 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:16:54,705 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-09 23:16:54,705 INFO L444 ModelExtractionUtils]: 32 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-09 23:16:54,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:16:54,706 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:16:54,706 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:16:54,706 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-09 23:16:54,765 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-09 23:16:54,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:54,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:54,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:54,815 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-09 23:16:54,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-09 23:16:54,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 98 transitions. cyclomatic complexity: 27 Second operand 4 states. [2018-11-09 23:16:54,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 98 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 202 states and 245 transitions. Complement of second has 7 states. [2018-11-09 23:16:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-09 23:16:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-09 23:16:54,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-09 23:16:54,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-09 23:16:54,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:54,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 245 transitions. [2018-11-09 23:16:54,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:16:54,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 134 states and 167 transitions. [2018-11-09 23:16:54,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-09 23:16:54,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-09 23:16:54,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 167 transitions. [2018-11-09 23:16:54,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:16:54,849 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-09 23:16:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 167 transitions. [2018-11-09 23:16:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2018-11-09 23:16:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-09 23:16:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-11-09 23:16:54,856 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-09 23:16:54,856 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-09 23:16:54,856 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-09 23:16:54,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 120 transitions. [2018-11-09 23:16:54,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:16:54,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:54,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:54,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:16:54,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:54,859 INFO L793 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1011#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1012#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 995#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 996#L547-3 assume true; 1015#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1074#L551-4 assume true; 1069#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1071#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 1076#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 1075#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 1072#L551-4 assume true; 1059#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1045#L550-3 assume !(diff_~found~0 == 0); 1043#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 1041#L547-3 assume true; 1007#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1008#L551-4 [2018-11-09 23:16:54,859 INFO L795 eck$LassoCheckResult]: Loop: 1008#L551-4 assume true; 1028#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1029#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 1024#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 1025#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 1008#L551-4 [2018-11-09 23:16:54,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1924074049, now seen corresponding path program 2 times [2018-11-09 23:16:54,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:54,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:16:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:54,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash 56489728, now seen corresponding path program 2 times [2018-11-09 23:16:54,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:54,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:54,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1673221312, now seen corresponding path program 3 times [2018-11-09 23:16:54,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:54,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:55,350 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 146 [2018-11-09 23:16:55,457 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-09 23:16:55,459 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:16:55,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:16:55,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:16:55,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:16:55,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:16:55,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:16:55,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:16:55,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:16:55,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-09 23:16:55,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:16:55,459 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:16:55,462 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-09 23:16:55,761 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 126 [2018-11-09 23:16:55,814 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-09 23:16:55,815 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-09 23:16:55,817 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-09 23:16:55,818 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-09 23:16:55,820 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-09 23:16:55,821 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-09 23:16:55,823 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-09 23:16:55,823 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-09 23:16:55,833 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-09 23:16:55,834 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-09 23:16:55,837 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-09 23:16:55,845 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-09 23:16:55,846 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-09 23:16:55,847 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-09 23:16:56,281 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:16:56,281 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:16:56,282 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-09 23:16:56,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,284 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-09 23:16:56,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,290 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-09 23:16:56,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,310 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-09 23:16:56,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,311 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:16:56,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,312 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:16:56,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,320 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-09 23:16:56,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,322 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-09 23:16:56,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,322 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:16:56,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,324 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:16:56,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,327 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-09 23:16:56,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,330 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-09 23:16:56,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,330 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:16:56,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,331 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:16:56,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,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-09 23:16:56,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:56,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:56,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:56,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,341 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-09 23:16:56,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,344 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-09 23:16:56,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,350 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-09 23:16:56,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,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-09 23:16:56,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,355 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-09 23:16:56,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:56,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:56,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:56,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,357 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-09 23:16:56,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:56,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:56,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:56,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:56,358 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-09 23:16:56,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:56,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:56,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:56,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:56,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:56,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:56,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:16:56,364 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:16:56,364 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:16:56,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:16:56,365 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:16:56,365 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:16:56,365 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-09 23:16:56,438 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2018-11-09 23:16:56,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:56,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:56,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:56,481 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-09 23:16:56,481 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-09 23:16:56,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-09 23:16:56,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 175 states and 224 transitions. Complement of second has 7 states. [2018-11-09 23:16:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-09 23:16:56,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-09 23:16:56,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:56,508 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:16:56,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:56,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:56,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:56,539 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-09 23:16:56,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:16:56,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-09 23:16:56,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 175 states and 224 transitions. Complement of second has 7 states. [2018-11-09 23:16:56,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-09 23:16:56,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-09 23:16:56,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:56,567 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:16:56,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:56,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:56,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:56,596 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-09 23:16:56,597 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:16:56,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-09 23:16:56,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 222 states and 279 transitions. Complement of second has 11 states. [2018-11-09 23:16:56,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-09 23:16:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-09 23:16:56,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:56,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 23 letters. Loop has 5 letters. [2018-11-09 23:16:56,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:56,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 18 letters. Loop has 10 letters. [2018-11-09 23:16:56,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:56,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 279 transitions. [2018-11-09 23:16:56,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:16:56,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 142 states and 178 transitions. [2018-11-09 23:16:56,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-09 23:16:56,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-09 23:16:56,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 178 transitions. [2018-11-09 23:16:56,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:16:56,631 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 178 transitions. [2018-11-09 23:16:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 178 transitions. [2018-11-09 23:16:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 77. [2018-11-09 23:16:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-09 23:16:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-11-09 23:16:56,638 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-09 23:16:56,638 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-09 23:16:56,638 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-09 23:16:56,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 100 transitions. [2018-11-09 23:16:56,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-09 23:16:56,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:16:56,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:16:56,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:16:56,639 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:16:56,639 INFO L793 eck$LassoCheckResult]: Stem: 2025#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2024#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 2016#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 2017#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 2001#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 2002#L547-3 assume true; 2021#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2068#L551-4 assume true; 2071#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2063#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 2061#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 2059#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 2056#L551-4 assume true; 2035#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2033#L550-3 assume !(diff_~found~0 == 0); 2034#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 2075#L547-3 assume true; 2076#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2077#L551-4 assume true; 2006#L550-1 [2018-11-09 23:16:56,639 INFO L795 eck$LassoCheckResult]: Loop: 2006#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2026#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 2027#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 2030#L551-2 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := diff_#t~post4 + 1;havoc diff_#t~post4; 2005#L551-4 assume true; 2006#L550-1 [2018-11-09 23:16:56,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash -483246596, now seen corresponding path program 4 times [2018-11-09 23:16:56,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:56,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:56,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash 62061750, now seen corresponding path program 2 times [2018-11-09 23:16:56,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:56,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:56,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:56,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:56,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:56,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 330253211, now seen corresponding path program 1 times [2018-11-09 23:16:56,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:16:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:16:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:56,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:16:56,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:16:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:16:57,084 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 146 [2018-11-09 23:16:57,201 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-09 23:16:57,202 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:16:57,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:16:57,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:16:57,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:16:57,203 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:16:57,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:16:57,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:16:57,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:16:57,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-11-09 23:16:57,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:16:57,203 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:16:57,205 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-09 23:16:57,210 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-09 23:16:57,211 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-09 23:16:57,212 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-09 23:16:57,523 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 124 [2018-11-09 23:16:57,554 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-09 23:16:57,555 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-09 23:16:57,556 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-09 23:16:57,557 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-09 23:16:57,558 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-09 23:16:57,559 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-09 23:16:57,560 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-09 23:16:57,561 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-09 23:16:57,566 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-09 23:16:57,567 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-09 23:16:57,568 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-09 23:16:57,717 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-09 23:16:57,928 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-09 23:16:58,008 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:16:58,008 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:16:58,009 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-09 23:16:58,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:58,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:58,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:58,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,011 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-09 23:16:58,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:58,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:58,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:58,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,012 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-09 23:16:58,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:58,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:58,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,014 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-09 23:16:58,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:58,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:58,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,019 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-09 23:16:58,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:58,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:58,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,021 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-09 23:16:58,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:58,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:58,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,026 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-09 23:16:58,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,027 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:16:58,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,028 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-09 23:16:58,028 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-09 23:16:58,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,035 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-09 23:16:58,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:16:58,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:16:58,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:58,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,041 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-09 23:16:58,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:16:58,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:16:58,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:16:58,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:16:58,042 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-09 23:16:58,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:16:58,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:16:58,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:16:58,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:16:58,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:16:58,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:16:58,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:16:58,087 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-09 23:16:58,087 INFO L444 ModelExtractionUtils]: 83 out of 88 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 23:16:58,087 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:16:58,088 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:16:58,088 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:16:58,088 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-09 23:16:58,149 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-09 23:16:58,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:58,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:58,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:58,211 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-09 23:16:58,211 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-09 23:16:58,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-09 23:16:58,228 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 172 states and 208 transitions. Complement of second has 7 states. [2018-11-09 23:16:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-09 23:16:58,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-09 23:16:58,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:58,233 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:16:58,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:58,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:58,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:58,273 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-09 23:16:58,273 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-09 23:16:58,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-09 23:16:58,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 169 states and 204 transitions. Complement of second has 9 states. [2018-11-09 23:16:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-09 23:16:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-09 23:16:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:58,293 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:16:58,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:16:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:58,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:16:58,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:16:58,330 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-09 23:16:58,331 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-09 23:16:58,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-09 23:16:58,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 201 states and 248 transitions. Complement of second has 13 states. [2018-11-09 23:16:58,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:16:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:16:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-09 23:16:58,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-09 23:16:58,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:58,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 24 letters. Loop has 5 letters. [2018-11-09 23:16:58,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:58,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 19 letters. Loop has 10 letters. [2018-11-09 23:16:58,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:16:58,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 248 transitions. [2018-11-09 23:16:58,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:16:58,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 0 states and 0 transitions. [2018-11-09 23:16:58,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 23:16:58,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 23:16:58,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 23:16:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:16:58,351 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:16:58,351 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:16:58,351 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:16:58,351 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-09 23:16:58,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:16:58,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:16:58,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 23:16:58,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 11:16:58 BoogieIcfgContainer [2018-11-09 23:16:58,359 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 23:16:58,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:16:58,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:16:58,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:16:58,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:16:49" (3/4) ... [2018-11-09 23:16:58,363 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 23:16:58,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:16:58,364 INFO L168 Benchmark]: Toolchain (without parser) took 8997.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.0 MB). Free memory was 957.5 MB in the beginning and 1.4 GB in the end (delta: -449.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-09 23:16:58,365 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:16:58,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.97 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-09 23:16:58,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -241.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:16:58,366 INFO L168 Benchmark]: Boogie Preprocessor took 19.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-09 23:16:58,366 INFO L168 Benchmark]: RCFGBuilder took 217.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-09 23:16:58,366 INFO L168 Benchmark]: BuchiAutomizer took 8413.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -253.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-09 23:16:58,367 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:16:58,370 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.97 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -241.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8413.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -253.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.5 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * i + l1 and consists of 4 locations. One deterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 7.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 94 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 302 SDtfs, 388 SDslu, 171 SDs, 0 SdLazy, 141 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital279 mio100 ax100 hnf98 lsp88 ukn107 mio100 lsp47 div100 bol100 ite100 ukn100 eq190 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...