./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/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 bee04d628cc50c5f036e0a10e9bd347013a62a54 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:57:06,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:57:06,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:57:06,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:57:06,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:57:06,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:57:06,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:57:06,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:57:06,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:57:06,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:57:06,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:57:06,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:57:06,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:57:06,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:57:06,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:57:06,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:57:06,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:57:06,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:57:06,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:57:06,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:57:06,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:57:06,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:57:06,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:57:06,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:57:06,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:57:06,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:57:06,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:57:06,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:57:06,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:57:06,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:57:06,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:57:06,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:57:06,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:57:06,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:57:06,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:57:06,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:57:06,304 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 10:57:06,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:57:06,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:57:06,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:57:06,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:57:06,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:57:06,316 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:57:06,316 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:57:06,316 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:57:06,316 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:57:06,316 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:57:06,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:57:06,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:57:06,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:57:06,318 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:57:06,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:57:06,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:57:06,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:57:06,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:57:06,318 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:57:06,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:57:06,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:57:06,319 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:57:06,319 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:57:06,320 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_9c6d4070-fc15-4a47-91ff-ef09b5752947/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 -> bee04d628cc50c5f036e0a10e9bd347013a62a54 [2018-11-28 10:57:06,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:57:06,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:57:06,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:57:06,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:57:06,350 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:57:06,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2018-11-28 10:57:06,389 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/data/bdfe1643d/c82080af4f5747cb9c0a757f229e687c/FLAGa35071af9 [2018-11-28 10:57:06,816 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:57:06,816 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2018-11-28 10:57:06,822 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/data/bdfe1643d/c82080af4f5747cb9c0a757f229e687c/FLAGa35071af9 [2018-11-28 10:57:06,832 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/data/bdfe1643d/c82080af4f5747cb9c0a757f229e687c [2018-11-28 10:57:06,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:57:06,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:57:06,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:57:06,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:57:06,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:57:06,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:57:06" (1/1) ... [2018-11-28 10:57:06,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd293b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:06, skipping insertion in model container [2018-11-28 10:57:06,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:57:06" (1/1) ... [2018-11-28 10:57:06,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:57:06,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:57:07,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:57:07,070 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:57:07,148 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:57:07,178 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:57:07,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07 WrapperNode [2018-11-28 10:57:07,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:57:07,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:57:07,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:57:07,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:57:07,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:57:07,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:57:07,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:57:07,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:57:07,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... [2018-11-28 10:57:07,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:57:07,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:57:07,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:57:07,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:57:07,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:57:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:57:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:57:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:57:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:57:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:57:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:57:07,441 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:57:07,442 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 10:57:07,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:57:07 BoogieIcfgContainer [2018-11-28 10:57:07,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:57:07,442 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:57:07,442 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:57:07,444 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:57:07,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:57:07,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:57:06" (1/3) ... [2018-11-28 10:57:07,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@367e35c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:57:07, skipping insertion in model container [2018-11-28 10:57:07,446 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:57:07,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:57:07" (2/3) ... [2018-11-28 10:57:07,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@367e35c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:57:07, skipping insertion in model container [2018-11-28 10:57:07,446 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:57:07,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:57:07" (3/3) ... [2018-11-28 10:57:07,447 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca_true-termination.c.i [2018-11-28 10:57:07,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:57:07,477 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:57:07,478 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:57:07,478 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:57:07,478 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:57:07,478 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:57:07,478 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:57:07,478 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:57:07,478 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:57:07,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 10:57:07,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 10:57:07,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:57:07,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:57:07,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:57:07,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:57:07,506 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:57:07,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 10:57:07,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 10:57:07,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:57:07,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:57:07,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:57:07,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:57:07,515 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-11-28 10:57:07,515 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-28 10:57:07,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 10:57:07,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:07,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-28 10:57:07,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:07,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:07,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:57:07,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:57:07,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:57:07,635 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:57:07,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 10:57:07,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 10:57:07,645 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 10:57:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:57:07,649 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 10:57:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:57:07,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 10:57:07,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 10:57:07,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-28 10:57:07,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 10:57:07,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 10:57:07,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 10:57:07,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:57:07,656 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 10:57:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 10:57:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 10:57:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 10:57:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 10:57:07,679 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 10:57:07,679 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 10:57:07,679 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:57:07,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 10:57:07,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 10:57:07,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:57:07,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:57:07,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:57:07,680 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:57:07,680 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2018-11-28 10:57:07,680 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-11-28 10:57:07,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 10:57:07,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-28 10:57:07,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:07,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:07,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:57:07,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-28 10:57:07,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:07,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:07,953 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 10:57:08,146 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-28 10:57:08,340 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-11-28 10:57:08,418 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:57:08,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:57:08,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:57:08,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:57:08,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:57:08,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:57:08,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:57:08,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:57:08,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 10:57:08,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:57:08,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:57:08,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:08,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,033 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-28 10:57:09,234 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:57:09,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:57:09,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:09,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:09,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:09,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:09,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:09,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:09,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:09,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:09,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:09,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:09,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:09,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:09,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:09,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,276 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 10:57:09,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,278 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:57:09,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:09,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:09,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:09,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:09,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:09,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:09,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:09,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:09,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:09,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:09,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:09,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:09,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:09,342 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:57:09,359 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 10:57:09,359 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:57:09,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:57:09,362 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:57:09,362 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:57:09,363 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-28 10:57:09,397 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 10:57:09,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 10:57:09,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:09,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:57:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:09,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:57:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:57:09,473 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:57:09,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 10:57:09,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-28 10:57:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:57:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:57:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-28 10:57:09,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 10:57:09,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:57:09,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-28 10:57:09,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:57:09,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-28 10:57:09,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:57:09,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 10:57:09,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:57:09,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-28 10:57:09,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 10:57:09,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:57:09,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-28 10:57:09,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:57:09,526 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 10:57:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-28 10:57:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 10:57:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 10:57:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 10:57:09,528 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 10:57:09,528 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 10:57:09,528 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:57:09,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 10:57:09,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:57:09,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:57:09,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:57:09,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:57:09,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:57:09,530 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 183#L382 assume !(main_~length1~0 < 1); 184#L382-2 assume !(main_~length2~0 < 1); 181#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 178#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 190#L372-5 [2018-11-28 10:57:09,530 INFO L796 eck$LassoCheckResult]: Loop: 190#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 185#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 186#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 190#L372-5 [2018-11-28 10:57:09,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-28 10:57:09,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:09,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:09,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:09,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-28 10:57:09,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:09,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:09,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:09,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:09,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-28 10:57:09,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:09,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:09,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:09,873 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-11-28 10:57:09,938 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:57:09,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:57:09,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:57:09,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:57:09,938 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:57:09,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:57:09,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:57:09,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:57:09,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 10:57:09,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:57:09,938 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:57:09,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:09,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,146 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2018-11-28 10:57:10,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:57:10,539 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 10:57:10,617 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:57:10,617 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:57:10,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:10,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:10,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:10,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:10,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:10,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:10,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:10,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:10,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:10,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:57:10,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:57:10,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:57:10,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,645 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:57:10,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,646 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:57:10,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,665 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:57:10,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,666 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:57:10,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,675 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:57:10,675 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 10:57:10,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,692 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-28 10:57:10,692 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 10:57:10,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:57:10,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:57:10,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:57:10,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:57:10,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:57:10,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:57:10,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:57:10,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:57:10,792 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:57:10,806 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:57:10,806 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 10:57:10,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:57:10,807 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:57:10,807 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:57:10,808 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2018-11-28 10:57:10,865 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 10:57:10,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:10,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:57:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:10,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:57:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:57:10,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:57:10,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 10:57:10,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2018-11-28 10:57:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:57:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:57:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-28 10:57:10,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 10:57:10,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:57:10,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 10:57:10,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:57:10,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 10:57:10,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:57:10,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-28 10:57:10,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:57:10,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-28 10:57:10,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 10:57:10,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:57:10,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-28 10:57:10,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:57:10,926 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-28 10:57:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-28 10:57:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-28 10:57:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 10:57:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-28 10:57:10,928 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 10:57:10,928 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 10:57:10,928 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:57:10,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-28 10:57:10,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:57:10,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:57:10,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:57:10,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:57:10,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:57:10,931 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 360#L382 assume !(main_~length1~0 < 1); 361#L382-2 assume !(main_~length2~0 < 1); 358#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 354#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 355#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 368#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 364#L372-1 assume !cstrcspn_#t~short210; 365#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 350#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 351#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 352#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 353#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 357#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 367#L372-5 [2018-11-28 10:57:10,931 INFO L796 eck$LassoCheckResult]: Loop: 367#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 362#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 363#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 367#L372-5 [2018-11-28 10:57:10,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-28 10:57:10,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:10,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:10,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-28 10:57:10,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:10,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:10,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-28 10:57:10,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:10,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:10,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:57:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:57:11,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:57:11,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c6d4070-fc15-4a47-91ff-ef09b5752947/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:57:11,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:57:11,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:57:11,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-28 10:57:11,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 10:57:11,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:57:11,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-28 10:57:11,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 10:57:11,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:57:11,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-28 10:57:11,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:57:11,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:57:11,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:57:11,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 10:57:11,162 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:33, output treesize:18 [2018-11-28 10:57:36,813 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 10:57:50,730 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 10:58:06,716 WARN L180 SmtUtils]: Spent 15.97 s on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-11-28 10:58:32,094 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 10:58:47,040 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 10:58:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:58:47,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:58:47,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 10:58:47,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 10:58:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-11-28 10:58:47,164 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-28 10:59:03,734 WARN L180 SmtUtils]: Spent 16.55 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-28 10:59:11,473 WARN L180 SmtUtils]: Spent 7.71 s on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2018-11-28 10:59:13,837 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-11-28 10:59:15,369 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 10:59:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:59:15,389 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-28 10:59:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:59:15,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-28 10:59:15,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:59:15,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-28 10:59:15,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 10:59:15,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 10:59:15,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-28 10:59:15,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:59:15,393 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-28 10:59:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-28 10:59:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-28 10:59:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 10:59:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-28 10:59:15,395 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 10:59:15,395 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 10:59:15,395 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:59:15,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-28 10:59:15,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:59:15,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:59:15,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:59:15,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:59:15,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:59:15,396 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 521#L382 assume !(main_~length1~0 < 1); 522#L382-2 assume !(main_~length2~0 < 1); 519#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 515#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 516#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 535#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 525#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 526#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 511#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 512#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 513#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 514#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 518#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 528#L372-5 [2018-11-28 10:59:15,396 INFO L796 eck$LassoCheckResult]: Loop: 528#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 523#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 528#L372-5 [2018-11-28 10:59:15,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:59:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-28 10:59:15,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:59:15,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:59:15,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:59:15,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:59:15,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:59:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:59:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:59:15,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:59:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-28 10:59:15,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:59:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:59:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:59:15,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:59:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:59:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:59:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:59:15,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:59:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-28 10:59:15,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:59:15,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:59:15,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:59:15,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:59:15,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:59:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:59:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:59:15,922 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 138 [2018-11-28 10:59:16,530 WARN L180 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-28 10:59:16,532 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:59:16,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:59:16,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:59:16,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:59:16,532 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:59:16,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:59:16,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:59:16,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:59:16,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 10:59:16,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:59:16,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:59:16,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:16,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-28 10:59:16,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-28 10:59:16,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-28 10:59:16,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-28 10:59:16,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:16,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-28 10:59:16,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-28 10:59:16,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-28 10:59:16,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-28 10:59:16,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-28 10:59:16,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-28 10:59:16,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:16,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:16,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:16,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:16,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 10:59:17,074 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2018-11-28 10:59:17,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:17,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:59:17,809 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-28 10:59:17,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:59:17,931 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:59:17,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:59:17,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:59:17,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:59:17,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,964 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:59:17,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,965 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:59:17,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:59:17,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:59:17,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:59:17,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:59:17,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:59:17,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:59:17,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:59:17,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:59:17,989 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:59:17,997 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 10:59:17,998 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 10:59:17,998 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:59:17,998 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:59:17,999 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:59:17,999 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2018-11-28 10:59:18,095 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-11-28 10:59:18,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:59:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:59:18,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:59:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:59:18,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:59:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:59:18,126 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:59:18,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 10:59:18,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-11-28 10:59:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:59:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:59:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-28 10:59:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:59:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:59:18,141 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:59:18,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:59:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:59:18,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:59:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:59:18,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:59:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:59:18,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:59:18,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 10:59:18,191 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-11-28 10:59:18,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:59:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:59:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-28 10:59:18,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:59:18,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:59:18,193 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:59:18,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:59:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:59:18,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:59:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:59:18,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:59:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:59:18,229 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:59:18,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 10:59:18,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2018-11-28 10:59:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:59:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:59:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-28 10:59:18,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:59:18,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:59:18,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 10:59:18,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:59:18,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 10:59:18,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:59:18,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-28 10:59:18,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:59:18,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-28 10:59:18,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:59:18,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:59:18,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:59:18,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:59:18,246 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:59:18,246 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:59:18,246 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:59:18,246 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:59:18,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:59:18,246 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:59:18,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:59:18,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:59:18 BoogieIcfgContainer [2018-11-28 10:59:18,251 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:59:18,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:59:18,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:59:18,252 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:59:18,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:57:07" (3/4) ... [2018-11-28 10:59:18,255 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:59:18,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:59:18,255 INFO L168 Benchmark]: Toolchain (without parser) took 131421.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:59:18,256 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:59:18,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:59:18,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:59:18,257 INFO L168 Benchmark]: Boogie Preprocessor took 21.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:59:18,257 INFO L168 Benchmark]: RCFGBuilder took 213.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:59:18,258 INFO L168 Benchmark]: BuchiAutomizer took 130808.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -72.5 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:59:18,258 INFO L168 Benchmark]: Witness Printer took 3.37 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-28 10:59:18,261 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 130808.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -72.5 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.37 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.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 130.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 102.1s. Construction of modules took 0.1s. Büchi inclusion checks took 28.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 153 SDslu, 81 SDs, 0 SdLazy, 135 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp37 div116 bol100 ite100 ukn100 eq180 hnf83 smp94 dnf855 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 95ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...