./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/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 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:07:35,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:07:35,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:07:35,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:07:35,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:07:35,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:07:35,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:07:35,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:07:35,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:07:35,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:07:35,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:07:35,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:07:35,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:07:35,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:07:35,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:07:35,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:07:35,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:07:35,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:07:35,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:07:35,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:07:35,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:07:35,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:07:35,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:07:35,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:07:35,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:07:35,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:07:35,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:07:35,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:07:35,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:07:35,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:07:35,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:07:35,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:07:35,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:07:35,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:07:35,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:07:35,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:07:35,366 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:07:35,375 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:07:35,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:07:35,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:07:35,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:07:35,376 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:07:35,376 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:07:35,376 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:07:35,377 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:07:35,377 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:07:35,377 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:07:35,377 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:07:35,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:07:35,377 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:07:35,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:07:35,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:07:35,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:07:35,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:07:35,379 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:07:35,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:07:35,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:07:35,379 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:07:35,380 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:07:35,380 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_2772005d-4153-4f8f-b135-a47ce45f2d08/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 -> 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca [2018-11-10 12:07:35,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:07:35,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:07:35,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:07:35,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:07:35,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:07:35,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i [2018-11-10 12:07:35,464 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/data/0a6d7fa37/331bcdd87c794766a3231b133a5f99e6/FLAGc13aa8fd7 [2018-11-10 12:07:35,913 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:07:35,914 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i [2018-11-10 12:07:35,922 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/data/0a6d7fa37/331bcdd87c794766a3231b133a5f99e6/FLAGc13aa8fd7 [2018-11-10 12:07:35,933 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/bin-2019/uautomizer/data/0a6d7fa37/331bcdd87c794766a3231b133a5f99e6 [2018-11-10 12:07:35,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:07:35,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:07:35,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:07:35,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:07:35,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:07:35,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:07:35" (1/1) ... [2018-11-10 12:07:35,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604393ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:35, skipping insertion in model container [2018-11-10 12:07:35,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:07:35" (1/1) ... [2018-11-10 12:07:35,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:07:35,978 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:07:36,206 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:07:36,214 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:07:36,248 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:07:36,290 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:07:36,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36 WrapperNode [2018-11-10 12:07:36,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:07:36,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:07:36,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:07:36,291 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:07:36,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:07:36,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:07:36,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:07:36,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:07:36,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... [2018-11-10 12:07:36,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:07:36,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:07:36,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:07:36,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:07:36,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2772005d-4153-4f8f-b135-a47ce45f2d08/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-10 12:07:36,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:07:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:07:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:07:36,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:07:36,607 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:07:36,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:07:36 BoogieIcfgContainer [2018-11-10 12:07:36,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:07:36,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:07:36,608 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:07:36,610 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:07:36,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:07:36,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:07:35" (1/3) ... [2018-11-10 12:07:36,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e7ef6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:07:36, skipping insertion in model container [2018-11-10 12:07:36,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:07:36,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:36" (2/3) ... [2018-11-10 12:07:36,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e7ef6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:07:36, skipping insertion in model container [2018-11-10 12:07:36,612 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:07:36,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:07:36" (3/3) ... [2018-11-10 12:07:36,613 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_diffterm_alloca_true-termination.c.i [2018-11-10 12:07:36,649 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:07:36,650 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:07:36,650 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:07:36,650 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:07:36,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:07:36,650 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:07:36,650 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:07:36,650 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:07:36,650 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:07:36,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 12:07:36,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:07:36,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:36,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:36,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:36,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:36,687 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:07:36,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 12:07:36,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:07:36,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:36,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:36,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:36,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:36,695 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 9#L382true assume !(main_~length1~0 < 1); 13#L382-2true assume !(main_~length2~0 < 1); 7#L385-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 12#L391true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L369-5true [2018-11-10 12:07:36,695 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 15#L369-1true SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 17#L369-2true assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 10#L371true SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 11#L371-1true cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-9true assume !true; 21#L372-10true SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 3#L369-4true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 4#L369-5true [2018-11-10 12:07:36,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 12:07:36,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:36,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:36,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 12:07:36,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:36,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:36,827 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-10 12:07:36,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:07:36,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:07:36,832 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:07:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:07:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:07:36,844 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 12:07:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:36,849 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 12:07:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:07:36,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 12:07:36,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:07:36,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 12:07:36,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 12:07:36,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 12:07:36,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 12:07:36,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:07:36,856 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 12:07:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 12:07:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 12:07:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 12:07:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 12:07:36,874 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 12:07:36,874 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 12:07:36,874 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:07:36,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 12:07:36,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:07:36,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:36,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:36,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:36,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:36,876 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 82#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 68#L369-5 [2018-11-10 12:07:36,876 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 78#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 49; 81#L372-3 assume !cstrspn_#t~short210; 64#L372-7 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 65#L372-10 SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 67#L369-4 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 68#L369-5 [2018-11-10 12:07:36,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 12:07:36,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:36,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:36,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 12:07:36,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:36,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:07:36,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:37,015 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-10 12:07:37,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:07:37,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 12:07:37,016 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:07:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:07:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:07:37,016 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 12:07:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:37,259 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-10 12:07:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:07:37,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-10 12:07:37,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 12:07:37,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-11-10 12:07:37,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 12:07:37,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 12:07:37,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-10 12:07:37,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:07:37,263 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-10 12:07:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-10 12:07:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-10 12:07:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 12:07:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 12:07:37,265 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 12:07:37,265 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 12:07:37,265 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:07:37,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-10 12:07:37,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 12:07:37,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:37,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:37,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:37,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:37,267 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 160#L382 assume !(main_~length1~0 < 1); 161#L382-2 assume !(main_~length2~0 < 1); 156#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 157#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 169#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 167#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 152#L369-5 [2018-11-10 12:07:37,267 INFO L795 eck$LassoCheckResult]: Loop: 152#L369-5 assume true; 153#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 170#L369-2 assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 162#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 163#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 150#L372-9 assume true; 155#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 165#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 49; 166#L372-3 assume cstrspn_#t~short210; 168#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 171#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 172#L372-7 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 158#L372-10 SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 154#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 151#L369-4 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 152#L369-5 [2018-11-10 12:07:37,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 12:07:37,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:37,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:37,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:37,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-11-10 12:07:37,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:37,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:07:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:37,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-11-10 12:07:37,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:37,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:37,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:37,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:37,488 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-10 12:07:37,667 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-10 12:07:37,845 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2018-11-10 12:07:37,918 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:37,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:37,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:37,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:37,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:07:37,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:37,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:37,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:37,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 12:07:37,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:37,920 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:37,935 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-10 12:07:37,938 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-10 12:07:37,939 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-10 12:07:37,941 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-10 12:07:37,943 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-10 12:07:37,944 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-10 12:07:37,946 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-10 12:07:37,948 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-10 12:07:38,203 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-10 12:07:38,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:38,305 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-10 12:07:38,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:38,307 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-10 12:07:38,308 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-10 12:07:38,309 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-10 12:07:38,310 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-10 12:07:38,312 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-10 12:07:38,313 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-10 12:07:38,314 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-10 12:07:38,710 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:38,713 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:07:38,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:07:38,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:38,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:38,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:38,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,720 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-10 12:07:38,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:38,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:38,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:38,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,723 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-10 12:07:38,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:38,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:38,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,728 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-10 12:07:38,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:38,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:38,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:38,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,730 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-10 12:07:38,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:38,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:38,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:38,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,732 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-10 12:07:38,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:38,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:38,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,736 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-10 12:07:38,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:38,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:38,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:38,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:07:38,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:38,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:38,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,743 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-10 12:07:38,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:38,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:38,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,761 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-10 12:07:38,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:38,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:38,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:38,766 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-10 12:07:38,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:38,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:38,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:38,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:38,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:38,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:38,799 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:07:38,829 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:07:38,829 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 12:07:38,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:07:38,832 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:07:38,833 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:07:38,833 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-11-10 12:07:38,873 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 12:07:38,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:07:38,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:38,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:38,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:38,947 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-10 12:07:38,950 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-10 12:07:38,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 12:07:39,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 40 states and 47 transitions. Complement of second has 7 states. [2018-11-10 12:07:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:07:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:07:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 12:07:39,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-11-10 12:07:39,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:39,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-11-10 12:07:39,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:39,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-11-10 12:07:39,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:39,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-10 12:07:39,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 12:07:39,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-11-10 12:07:39,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 12:07:39,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 12:07:39,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-10 12:07:39,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:39,011 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-10 12:07:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-10 12:07:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 12:07:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:07:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-10 12:07:39,025 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 12:07:39,025 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 12:07:39,025 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:07:39,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-11-10 12:07:39,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:07:39,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:39,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:39,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:39,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 12:07:39,027 INFO L793 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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; 365#L382 assume !(main_~length1~0 < 1); 366#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 362#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 379#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 376#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 355#L369-5 assume true; 357#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 382#L369-2 assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 367#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 368#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 350#L372-9 [2018-11-10 12:07:39,027 INFO L795 eck$LassoCheckResult]: Loop: 350#L372-9 assume true; 359#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 371#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 49; 374#L372-3 assume !cstrspn_#t~short210; 349#L372-7 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset + 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 350#L372-9 [2018-11-10 12:07:39,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 12:07:39,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 12:07:39,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:39,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:39,055 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-10 12:07:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:07:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:07:39,055 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:07:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:07:39,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:07:39,056 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 12:07:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:39,070 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 12:07:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:07:39,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 12:07:39,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:07:39,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-11-10 12:07:39,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 12:07:39,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 12:07:39,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-10 12:07:39,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:39,073 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 12:07:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-10 12:07:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 12:07:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 12:07:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 12:07:39,074 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 12:07:39,074 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 12:07:39,075 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:07:39,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 12:07:39,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:07:39,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:39,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:39,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:39,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:39,076 INFO L793 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 444#L382 assume !(main_~length1~0 < 1); 445#L382-2 assume !(main_~length2~0 < 1); 441#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 442#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 458#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 455#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 435#L369-5 assume true; 437#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 459#L369-2 assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 447#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 448#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 429#L372-9 [2018-11-10 12:07:39,076 INFO L795 eck$LassoCheckResult]: Loop: 429#L372-9 assume true; 439#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 451#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 49; 453#L372-3 assume cstrspn_#t~short210; 456#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 461#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 428#L372-7 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset + 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 429#L372-9 [2018-11-10 12:07:39,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 12:07:39,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:39,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 12:07:39,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:07:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 12:07:39,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:39,440 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2018-11-10 12:07:39,541 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:39,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:39,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:39,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:39,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:07:39,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:39,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:39,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:39,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 12:07:39,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:39,542 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:39,546 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-10 12:07:39,547 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-10 12:07:39,548 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-10 12:07:39,549 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-10 12:07:39,550 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-10 12:07:39,551 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-10 12:07:39,552 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-10 12:07:39,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:39,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:39,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:39,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:39,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:39,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:07:39,788 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-11-10 12:07:39,882 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-10 12:07:39,883 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-10 12:07:39,884 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-10 12:07:39,885 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-10 12:07:39,886 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-10 12:07:39,887 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-10 12:07:40,029 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-11-10 12:07:40,381 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 12:07:40,398 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:40,398 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:07:40,399 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-10 12:07:40,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,401 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-10 12:07:40,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,407 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-10 12:07:40,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,408 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-10 12:07:40,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:40,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:40,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,411 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-10 12:07:40,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,412 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-10 12:07:40,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,413 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-10 12:07:40,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,415 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-10 12:07:40,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:40,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:40,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,417 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-10 12:07:40,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:40,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:40,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,420 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-10 12:07:40,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,422 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-10 12:07:40,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,424 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-10 12:07:40,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:40,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:40,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:40,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,425 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-10 12:07:40,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:40,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:40,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,429 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-10 12:07:40,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:40,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:40,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:40,432 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-10 12:07:40,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:40,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:40,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:40,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:40,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:40,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:40,461 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:07:40,478 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:07:40,478 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:07:40,478 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:07:40,480 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:07:40,480 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:07:40,480 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-10 12:07:40,544 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 12:07:40,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:07:40,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:40,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:40,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:40,595 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-10 12:07:40,595 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-10 12:07:40,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 12:07:40,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 86 states and 94 transitions. Complement of second has 7 states. [2018-11-10 12:07:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:07:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:07:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 12:07:40,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 12:07:40,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:40,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 12:07:40,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:40,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 12:07:40,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:40,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-11-10 12:07:40,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:07:40,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-11-10 12:07:40,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:07:40,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:07:40,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-11-10 12:07:40,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:40,621 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 12:07:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-11-10 12:07:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-10 12:07:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 12:07:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 12:07:40,623 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 12:07:40,623 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 12:07:40,623 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:07:40,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 12:07:40,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:07:40,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:40,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:40,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:40,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:40,625 INFO L793 eck$LassoCheckResult]: Stem: 727#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 718#L382 assume !(main_~length1~0 < 1); 719#L382-2 assume !(main_~length2~0 < 1); 715#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 716#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 735#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 732#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 707#L369-5 assume true; 708#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 748#L369-2 assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 747#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 728#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 729#L372-9 assume true; 745#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 744#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 49; 743#L372-3 assume cstrspn_#t~short210; 742#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 741#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 703#L372-7 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 704#L372-10 SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 711#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 705#L369-4 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 706#L369-5 assume true; 710#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 738#L369-2 assume !!(cstrspn_#t~mem206 != 49);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 720#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 721#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 702#L372-9 [2018-11-10 12:07:40,625 INFO L795 eck$LassoCheckResult]: Loop: 702#L372-9 assume true; 712#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 724#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 49; 730#L372-3 assume cstrspn_#t~short210; 733#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 736#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 701#L372-7 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset + 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 702#L372-9 [2018-11-10 12:07:40,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-11-10 12:07:40,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:40,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:40,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:40,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:40,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 12:07:40,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:40,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:07:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:40,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 12:07:40,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:40,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:07:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:41,299 WARN L179 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2018-11-10 12:07:42,171 WARN L179 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2018-11-10 12:07:42,172 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:42,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:42,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:42,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:42,173 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:07:42,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:42,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:42,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:42,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 12:07:42,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:42,173 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:42,179 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-10 12:07:42,187 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-10 12:07:42,189 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-10 12:07:42,191 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-10 12:07:42,193 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-10 12:07:42,194 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-10 12:07:42,196 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-10 12:07:42,198 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-10 12:07:42,200 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-10 12:07:42,202 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-10 12:07:42,204 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-10 12:07:42,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:07:42,981 WARN L179 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-11-10 12:07:43,079 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-10 12:07:43,080 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-10 12:07:43,081 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-10 12:07:43,082 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-10 12:07:43,083 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-10 12:07:43,085 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-10 12:07:43,086 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-10 12:07:43,090 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-10 12:07:43,762 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-10 12:07:43,869 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 12:07:43,877 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:43,877 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:07:43,877 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-10 12:07:43,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,883 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-10 12:07:43,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,884 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-10 12:07:43,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:43,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,886 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-10 12:07:43,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,888 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-10 12:07:43,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,890 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-10 12:07:43,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,891 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-10 12:07:43,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,893 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-10 12:07:43,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,894 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-10 12:07:43,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:43,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,897 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-10 12:07:43,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:43,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:43,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:43,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,898 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-10 12:07:43,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,899 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:07:43,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:07:43,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,906 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-10 12:07:43,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:43,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,909 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-10 12:07:43,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:43,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,912 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-10 12:07:43,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:43,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,916 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-10 12:07:43,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,916 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:07:43,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,917 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:07:43,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:43,922 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-10 12:07:43,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:43,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:43,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:43,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:43,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:07:43,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:07:43,947 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:07:43,966 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:07:43,966 INFO L444 ModelExtractionUtils]: 60 out of 67 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:07:43,967 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:07:43,967 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:07:43,968 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:07:43,968 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-10 12:07:44,072 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-11-10 12:07:44,074 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:07:44,074 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:07:44,074 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 12:07:44,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:44,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:44,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:44,154 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-10 12:07:44,154 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 12:07:44,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 12:07:44,206 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 12:07:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:07:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:07:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 12:07:44,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 12:07:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:44,209 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:07:44,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:44,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:44,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:44,280 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-10 12:07:44,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 12:07:44,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 12:07:44,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 12:07:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:07:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:07:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 12:07:44,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 12:07:44,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:44,329 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:07:44,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:44,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:44,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:44,386 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-10 12:07:44,386 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 12:07:44,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 12:07:44,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-11-10 12:07:44,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:07:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:07:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-10 12:07:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 12:07:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 12:07:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 12:07:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:44,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 12:07:44,442 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:07:44,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 12:07:44,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:07:44,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:07:44,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:07:44,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:07:44,443 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:07:44,443 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:07:44,443 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:07:44,443 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:07:44,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:07:44,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:07:44,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:07:44,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:07:44 BoogieIcfgContainer [2018-11-10 12:07:44,449 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:07:44,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:07:44,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:07:44,449 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:07:44,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:07:36" (3/4) ... [2018-11-10 12:07:44,453 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:07:44,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:07:44,454 INFO L168 Benchmark]: Toolchain (without parser) took 8517.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 142.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:07:44,454 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:07:44,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:07:44,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:07:44,456 INFO L168 Benchmark]: Boogie Preprocessor took 16.49 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:07:44,457 INFO L168 Benchmark]: RCFGBuilder took 224.78 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:07:44,457 INFO L168 Benchmark]: BuchiAutomizer took 7840.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:07:44,458 INFO L168 Benchmark]: Witness Printer took 3.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:07:44,462 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.49 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.78 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7840.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.92 ms. Allocated memory is still 1.3 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 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 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 191 SDtfs, 265 SDslu, 209 SDs, 0 SdLazy, 204 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf99 lsp91 ukn86 mio100 lsp31 div122 bol100 ite100 ukn100 eq173 hnf82 smp96 dnf531 smp32 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...