./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fcd11173df80f9a00fde2714abfd2a4ff8d40757 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:35:39,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:35:39,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:35:39,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:35:39,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:35:39,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:35:39,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:35:39,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:35:39,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:35:39,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:35:39,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:35:39,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:35:39,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:35:39,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:35:39,577 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:35:39,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:35:39,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:35:39,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:35:39,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:35:39,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:35:39,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:35:39,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:35:39,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:35:39,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:35:39,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:35:39,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:35:39,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:35:39,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:35:39,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:35:39,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:35:39,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:35:39,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:35:39,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:35:39,589 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:35:39,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:35:39,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:35:39,590 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:35:39,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:35:39,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:35:39,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:35:39,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:35:39,602 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:35:39,602 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:35:39,602 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:35:39,602 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:35:39,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:35:39,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:35:39,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:35:39,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:35:39,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:35:39,604 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:35:39,604 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:35:39,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:35:39,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:35:39,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:35:39,605 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:35:39,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:35:39,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:35:39,605 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:35:39,606 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:35:39,606 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_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2018-11-23 03:35:39,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:35:39,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:35:39,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:35:39,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:35:39,642 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:35:39,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-23 03:35:39,686 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/data/2e042e1f7/83793ab6dc064d77a9843cd6c4e3d32e/FLAGb0e5df4c9 [2018-11-23 03:35:40,029 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:35:40,029 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-23 03:35:40,036 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/data/2e042e1f7/83793ab6dc064d77a9843cd6c4e3d32e/FLAGb0e5df4c9 [2018-11-23 03:35:40,047 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/data/2e042e1f7/83793ab6dc064d77a9843cd6c4e3d32e [2018-11-23 03:35:40,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:35:40,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:35:40,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:35:40,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:35:40,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:35:40,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa062a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40, skipping insertion in model container [2018-11-23 03:35:40,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:35:40,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:35:40,318 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:35:40,324 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:35:40,406 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:35:40,435 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:35:40,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40 WrapperNode [2018-11-23 03:35:40,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:35:40,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:35:40,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:35:40,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:35:40,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:35:40,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:35:40,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:35:40,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:35:40,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... [2018-11-23 03:35:40,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:35:40,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:35:40,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:35:40,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:35:40,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:35:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:35:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:35:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:35:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:35:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:35:40,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:35:40,703 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:35:40,703 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 03:35:40,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:40 BoogieIcfgContainer [2018-11-23 03:35:40,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:35:40,704 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:35:40,704 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:35:40,707 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:35:40,708 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:35:40,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:35:40" (1/3) ... [2018-11-23 03:35:40,709 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe6c779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:35:40, skipping insertion in model container [2018-11-23 03:35:40,709 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:35:40,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:40" (2/3) ... [2018-11-23 03:35:40,709 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe6c779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:35:40, skipping insertion in model container [2018-11-23 03:35:40,710 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:35:40,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:40" (3/3) ... [2018-11-23 03:35:40,711 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-23 03:35:40,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:35:40,746 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:35:40,747 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:35:40,747 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:35:40,747 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:35:40,747 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:35:40,747 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:35:40,747 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:35:40,747 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:35:40,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:35:40,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:35:40,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:35:40,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:35:40,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:35:40,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:35:40,779 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:35:40,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:35:40,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:35:40,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:35:40,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:35:40,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:35:40,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:35:40,788 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-11-23 03:35:40,789 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-23 03:35:40,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:40,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 03:35:40,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:40,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:40,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 03:35:40,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:40,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:35:40,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:35:40,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:35:40,918 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:35:40,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:35:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:35:40,928 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 03:35:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:35:40,932 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 03:35:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:35:40,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 03:35:40,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:35:40,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 03:35:40,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 03:35:40,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 03:35:40,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 03:35:40,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:35:40,938 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:35:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 03:35:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 03:35:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 03:35:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 03:35:40,962 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:35:40,962 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:35:40,962 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:35:40,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 03:35:40,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:35:40,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:35:40,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:35:40,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:35:40,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:35:40,964 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2018-11-23 03:35:40,964 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-11-23 03:35:40,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 03:35:40,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:40,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 03:35:40,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:40,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:40,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:35:40,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:41,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 03:35:41,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:41,235 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 03:35:41,430 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-23 03:35:41,594 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 03:35:41,700 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:35:41,701 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:35:41,701 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:35:41,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:35:41,702 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:35:41,702 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:35:41,702 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:35:41,702 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:35:41,702 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 03:35:41,702 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:35:41,702 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:35:41,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:41,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:41,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:41,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:42,426 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-11-23 03:35:42,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:35:42,549 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:35:42,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:42,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:42,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:42,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:42,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:42,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:42,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:42,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:42,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:42,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:42,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:42,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:42,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:42,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:42,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:42,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:42,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:42,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:42,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:42,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:42,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:42,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:42,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:42,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:42,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:35:42,620 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:35:42,621 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:35:42,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:35:42,624 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:35:42,624 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:35:42,625 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-11-23 03:35:42,661 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 03:35:42,667 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:35:42,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:42,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:35:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:42,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:35:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:35:42,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:35:42,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 03:35:42,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-23 03:35:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:35:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:35:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 03:35:42,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 03:35:42,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:35:42,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 03:35:42,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:35:42,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 03:35:42,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:35:42,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 03:35:42,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:35:42,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 03:35:42,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 03:35:42,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:35:42,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 03:35:42,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:35:42,801 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:35:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 03:35:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 03:35:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:35:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 03:35:42,804 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:35:42,804 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:35:42,804 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:35:42,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 03:35:42,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:35:42,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:35:42,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:35:42,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:35:42,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:35:42,806 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 182#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 184#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 194#L372-5 [2018-11-23 03:35:42,806 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 189#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 194#L372-5 [2018-11-23 03:35:42,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 03:35:42,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:42,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:42,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 03:35:42,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:42,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:42,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:42,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 03:35:42,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:42,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:42,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:42,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:42,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:43,182 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-23 03:35:43,263 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:35:43,263 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:35:43,263 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:35:43,263 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:35:43,263 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:35:43,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:35:43,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:35:43,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:35:43,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 03:35:43,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:35:43,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:35:43,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,453 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-23 03:35:43,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:43,928 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-23 03:35:43,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:35:43,935 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:35:43,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:43,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:43,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:43,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:43,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:43,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:43,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:43,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:43,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:43,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:43,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:35:43,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:35:43,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:43,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:43,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:43,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:43,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:35:43,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:43,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:43,992 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:35:43,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:44,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:44,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:44,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:44,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:44,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:44,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:44,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:44,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:44,021 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:35:44,037 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 03:35:44,037 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:35:44,037 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:35:44,039 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:35:44,039 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:35:44,039 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 03:35:44,102 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 03:35:44,104 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:35:44,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:44,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:35:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:44,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:35:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:35:44,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:35:44,156 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 03:35:44,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 03:35:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:35:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:35:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:35:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:35:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:35:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 03:35:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:35:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 03:35:44,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:35:44,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 03:35:44,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:35:44,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 03:35:44,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:35:44,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:35:44,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 03:35:44,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:35:44,190 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 03:35:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 03:35:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 03:35:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:35:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 03:35:44,192 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:35:44,192 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:35:44,192 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:35:44,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 03:35:44,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:35:44,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:35:44,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:35:44,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:35:44,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:35:44,193 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 368#L382 assume !(main_~length1~0 < 1); 369#L382-2 assume !(main_~length2~0 < 1); 366#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 362#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 363#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 376#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 372#L372-1 assume !cstrcspn_#t~short210; 373#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 358#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 359#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 360#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 361#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 365#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 375#L372-5 [2018-11-23 03:35:44,194 INFO L796 eck$LassoCheckResult]: Loop: 375#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 370#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 371#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 375#L372-5 [2018-11-23 03:35:44,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 03:35:44,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:44,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:44,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 03:35:44,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:44,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:44,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:44,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:44,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-23 03:35:44,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:44,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:44,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:44,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:35:44,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:35:44,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:35:44,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc8a99a2-cb44-4aa7-8798-65512296bcf2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:35:44,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:35:44,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:35:44,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-23 03:35:44,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 03:35:44,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:35:44,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 03:35:44,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 03:35:44,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:35:44,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:35:44,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:35:44,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 03:35:44,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-23 03:35:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:35:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:35:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-23 03:35:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:35:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2018-11-23 03:35:56,644 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-23 03:35:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:35:56,779 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 03:35:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:35:56,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-23 03:35:56,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:35:56,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-23 03:35:56,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 03:35:56,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 03:35:56,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-23 03:35:56,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:35:56,783 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 03:35:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-23 03:35:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-23 03:35:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:35:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 03:35:56,786 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:35:56,786 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:35:56,786 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:35:56,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 03:35:56,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:35:56,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:35:56,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:35:56,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:35:56,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:35:56,787 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 523#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 524#L382 assume !(main_~length1~0 < 1); 525#L382-2 assume !(main_~length2~0 < 1); 522#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 518#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 519#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 538#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 529#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 530#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 514#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 515#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 516#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 517#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 521#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 531#L372-5 [2018-11-23 03:35:56,787 INFO L796 eck$LassoCheckResult]: Loop: 531#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 527#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 528#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 531#L372-5 [2018-11-23 03:35:56,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 03:35:56,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:56,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:35:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:56,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 03:35:56,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:56,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:56,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:35:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:56,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:35:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 03:35:56,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:35:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:35:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:56,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:35:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:35:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:35:57,344 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 133 [2018-11-23 03:35:57,954 WARN L180 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-23 03:35:57,957 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:35:57,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:35:57,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:35:57,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:35:57,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:35:57,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:35:57,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:35:57,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:35:57,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 03:35:57,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:35:57,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:35:57,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-23 03:35:57,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-23 03:35:57,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-23 03:35:57,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-23 03:35:57,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:57,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:58,157 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:35:58,548 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-23 03:35:58,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:35:59,385 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-11-23 03:35:59,489 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-23 03:35:59,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:35:59,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:35:59,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:35:59,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:35:59,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:35:59,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,599 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:35:59,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,600 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:35:59,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,611 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-23 03:35:59,611 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-23 03:35:59,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,647 INFO L402 nArgumentSynthesizer]: We have 280 Motzkin's Theorem applications. [2018-11-23 03:35:59,648 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-23 03:35:59,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,837 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:35:59,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,838 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:35:59,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:35:59,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:35:59,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:35:59,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:35:59,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:35:59,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:35:59,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:35:59,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:35:59,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:35:59,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:35:59,863 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 03:35:59,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:35:59,864 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:35:59,864 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:35:59,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 03:36:00,003 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-23 03:36:00,005 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:36:00,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:36:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:36:00,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:36:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:36:00,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:36:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:36:00,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:36:00,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:36:00,088 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-23 03:36:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:36:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:36:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:36:00,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:36:00,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:36:00,090 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:36:00,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:36:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:36:00,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:36:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:36:00,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:36:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:36:00,139 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:36:00,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:36:00,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-23 03:36:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:36:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:36:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:36:00,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:36:00,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:36:00,165 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:36:00,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:36:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:36:00,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:36:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:36:00,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:36:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:36:00,219 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:36:00,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:36:00,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-11-23 03:36:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:36:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:36:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 03:36:00,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:36:00,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:36:00,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 03:36:00,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:36:00,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 03:36:00,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:36:00,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-23 03:36:00,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:36:00,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-23 03:36:00,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:36:00,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:36:00,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:36:00,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:36:00,251 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:36:00,251 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:36:00,251 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:36:00,251 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:36:00,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:36:00,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:36:00,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:36:00,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:36:00 BoogieIcfgContainer [2018-11-23 03:36:00,256 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:36:00,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:36:00,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:36:00,257 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:36:00,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:40" (3/4) ... [2018-11-23 03:36:00,259 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:36:00,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:36:00,260 INFO L168 Benchmark]: Toolchain (without parser) took 20209.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:36:00,260 INFO L168 Benchmark]: CDTParser took 0.14 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-23 03:36:00,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:36:00,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:36:00,261 INFO L168 Benchmark]: Boogie Preprocessor took 20.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:36:00,262 INFO L168 Benchmark]: RCFGBuilder took 217.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:36:00,262 INFO L168 Benchmark]: BuchiAutomizer took 19552.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 220.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:36:00,263 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:36:00,265 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.14 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 383.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 217.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19552.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 220.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 145 SDslu, 110 SDs, 0 SdLazy, 154 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital372 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp32 div131 bol100 ite100 ukn100 eq165 hnf77 smp87 dnf1072 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 225ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 12 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 280 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...