./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 646417a8dd8807492175439f0c109786ec3887ae ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:58,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:58,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:58,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:58,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:58,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:58,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:58,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:58,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:58,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:58,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:58,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:58,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:58,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:58,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:58,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:58,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:58,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:58,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:58,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:58,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:58,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:58,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:58,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:58,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:58,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:58,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:58,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:58,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:58,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:58,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:58,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:58,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:58,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:58,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:58,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:58,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:58,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:58,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:58,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:58,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:58,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:57:58,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:58,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:58,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:58,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:58,159 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:58,159 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:57:58,159 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:57:58,159 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:57:58,159 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:57:58,160 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:57:58,160 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:57:58,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:58,160 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:58,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:57:58,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:58,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:58,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:58,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:57:58,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:57:58,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:57:58,163 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:58,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:58,164 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:57:58,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:58,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:57:58,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:58,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:58,165 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:57:58,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:58,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:58,165 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:57:58,166 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:57:58,166 INFO L138 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/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 646417a8dd8807492175439f0c109786ec3887ae [2019-11-25 08:57:58,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:58,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:58,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:58,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:58,318 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:58,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-11-25 08:57:58,373 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/data/1ecc15286/612719f7058c4da794206bcb8f370b97/FLAG18f86b11b [2019-11-25 08:57:58,788 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:58,788 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-11-25 08:57:58,805 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/data/1ecc15286/612719f7058c4da794206bcb8f370b97/FLAG18f86b11b [2019-11-25 08:57:59,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/data/1ecc15286/612719f7058c4da794206bcb8f370b97 [2019-11-25 08:57:59,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:59,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:59,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:59,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:59,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:59,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f88f91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59, skipping insertion in model container [2019-11-25 08:57:59,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:59,186 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:59,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:59,577 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:59,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:59,667 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:59,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59 WrapperNode [2019-11-25 08:57:59,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:59,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:59,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:59,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:59,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:59,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:59,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:59,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:59,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... [2019-11-25 08:57:59,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:59,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:59,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:59,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:59,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/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 [2019-11-25 08:57:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:57:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:57:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:57:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:57:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:59,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:58:00,109 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:58:00,110 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-25 08:58:00,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:00 BoogieIcfgContainer [2019-11-25 08:58:00,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:58:00,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:58:00,112 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:58:00,114 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:58:00,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:58:00,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:57:59" (1/3) ... [2019-11-25 08:58:00,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1648d69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:58:00, skipping insertion in model container [2019-11-25 08:58:00,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:58:00,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:59" (2/3) ... [2019-11-25 08:58:00,117 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1648d69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:58:00, skipping insertion in model container [2019-11-25 08:58:00,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:58:00,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:00" (3/3) ... [2019-11-25 08:58:00,118 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-1.i [2019-11-25 08:58:00,154 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:58:00,154 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:58:00,154 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:58:00,155 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:58:00,155 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:58:00,155 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:58:00,155 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:58:00,155 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:58:00,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-25 08:58:00,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-25 08:58:00,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:00,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:00,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:58:00,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:58:00,191 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:58:00,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-25 08:58:00,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-25 08:58:00,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:00,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:00,194 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:58:00,194 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:58:00,199 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 13#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2019-11-25 08:58:00,199 INFO L796 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2019-11-25 08:58:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-25 08:58:00,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:00,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206216054] [2019-11-25 08:58:00,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:00,327 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-25 08:58:00,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:00,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523503796] [2019-11-25 08:58:00,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:00,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-25 08:58:00,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:00,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240369833] [2019-11-25 08:58:00,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:00,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:00,650 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-25 08:58:00,736 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:00,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:00,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:00,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:00,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:00,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:00,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:00,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:00,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration1_Lasso [2019-11-25 08:58:00,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:00,738 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:00,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,945 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-25 08:58:00,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:00,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:01,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:01,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:01,332 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:58:01,336 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,341 INFO L120 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 [2019-11-25 08:58:01,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:01,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:01,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:01,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,371 INFO L120 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 [2019-11-25 08:58:01,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:01,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:01,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:01,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,413 INFO L120 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 [2019-11-25 08:58:01,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:01,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:01,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:01,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,427 INFO L120 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 [2019-11-25 08:58:01,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:01,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:01,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,457 INFO L120 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 [2019-11-25 08:58:01,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:01,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:01,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:01,485 INFO L120 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 [2019-11-25 08:58:01,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:01,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:01,513 INFO L120 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 [2019-11-25 08:58:01,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:01,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:01,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:01,553 INFO L120 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 [2019-11-25 08:58:01,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:01,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:01,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:01,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:01,576 INFO L120 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 [2019-11-25 08:58:01,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:01,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:01,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:01,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:01,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:01,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:58:01,634 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-25 08:58:01,634 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:01,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:01,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:58:01,654 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:58:01,654 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-25 08:58:01,677 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-25 08:58:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:01,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:58:01,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:01,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:58:01,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:01,786 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 [2019-11-25 08:58:01,788 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-25 08:58:01,858 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2019-11-25 08:58:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:58:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-25 08:58:01,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-25 08:58:01,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:01,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-25 08:58:01,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:01,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-25 08:58:01,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:01,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-25 08:58:01,879 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-25 08:58:01,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2019-11-25 08:58:01,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-25 08:58:01,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-25 08:58:01,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-25 08:58:01,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:01,889 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-25 08:58:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-25 08:58:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-25 08:58:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-25 08:58:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-25 08:58:01,918 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-25 08:58:01,918 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-25 08:58:01,919 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:58:01,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-25 08:58:01,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-25 08:58:01,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:01,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:01,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:01,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:58:01,927 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 167#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 163#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 164#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L546-3 [2019-11-25 08:58:01,927 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 165#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L546-3 [2019-11-25 08:58:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-25 08:58:01,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88935382] [2019-11-25 08:58:01,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:01,980 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-25 08:58:01,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60820073] [2019-11-25 08:58:01,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:01,996 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-25 08:58:01,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827542660] [2019-11-25 08:58:01,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:02,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:02,255 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-25 08:58:02,337 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:02,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:02,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:02,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:02,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:02,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:02,338 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:02,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:02,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration2_Lasso [2019-11-25 08:58:02,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:02,338 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:02,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,523 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-25 08:58:02,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:02,889 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:58:02,890 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:02,905 INFO L120 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 [2019-11-25 08:58:02,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:02,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:02,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:02,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:02,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:02,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:02,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:02,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:02,921 INFO L120 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 [2019-11-25 08:58:02,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:02,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:02,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:02,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:02,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:02,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:02,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:02,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:02,940 INFO L120 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 [2019-11-25 08:58:02,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:02,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:02,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:02,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:02,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:02,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:02,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:02,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:02,957 INFO L120 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 [2019-11-25 08:58:02,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:02,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:02,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:02,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:02,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:02,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:02,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:02,977 INFO L120 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 [2019-11-25 08:58:02,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:02,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:02,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:02,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:02,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:02,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:02,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:02,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:02,997 INFO L120 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 [2019-11-25 08:58:02,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:02,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:02,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:02,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:03,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:03,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:03,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:03,025 INFO L120 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 [2019-11-25 08:58:03,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:03,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:03,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:03,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:03,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:03,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:03,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:03,041 INFO L120 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 [2019-11-25 08:58:03,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:03,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:03,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:03,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:03,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:03,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:03,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:03,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:03,066 INFO L120 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 [2019-11-25 08:58:03,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:03,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:03,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:03,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:03,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:03,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:03,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:03,097 INFO L120 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 [2019-11-25 08:58:03,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:03,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:03,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:03,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:03,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:03,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:03,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:03,115 INFO L120 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 [2019-11-25 08:58:03,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:03,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:03,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:03,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:03,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:03,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:03,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:58:03,240 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-25 08:58:03,240 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:03,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:03,292 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:58:03,292 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:58:03,292 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2019-11-25 08:58:03,310 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2019-11-25 08:58:03,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:58:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:58:03,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,376 WARN L253 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:58:03,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:03,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-25 08:58:03,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-25 08:58:03,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 44 transitions. Complement of second has 7 states. [2019-11-25 08:58:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:58:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-25 08:58:03,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-25 08:58:03,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:03,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-25 08:58:03,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:03,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-25 08:58:03,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:03,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-25 08:58:03,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-25 08:58:03,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-25 08:58:03,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-25 08:58:03,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-25 08:58:03,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-25 08:58:03,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:03,488 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-25 08:58:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-25 08:58:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-25 08:58:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-25 08:58:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-25 08:58:03,491 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-25 08:58:03,491 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-25 08:58:03,491 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:58:03,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-25 08:58:03,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-25 08:58:03,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:03,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:03,493 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:03,493 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:03,493 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 304#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 305#L532 assume !(main_~length1~0 < 1); 306#L532-2 assume !(main_~length2~0 < 1); 299#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 300#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 296#L541-4 main_~i~1 := 0; 297#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 303#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 293#L519-4 [2019-11-25 08:58:03,494 INFO L796 eck$LassoCheckResult]: Loop: 293#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 298#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 310#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 307#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 308#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 294#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 295#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 292#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 293#L519-4 [2019-11-25 08:58:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-25 08:58:03,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20635109] [2019-11-25 08:58:03,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:03,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-25 08:58:03,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721192830] [2019-11-25 08:58:03,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:03,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-25 08:58:03,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963516059] [2019-11-25 08:58:03,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:03,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963516059] [2019-11-25 08:58:03,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:03,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:58:03,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778075235] [2019-11-25 08:58:03,952 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-25 08:58:04,200 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-25 08:58:04,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:04,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:58:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:58:04,205 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-25 08:58:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:04,553 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-11-25 08:58:04,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:58:04,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-25 08:58:04,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-25 08:58:04,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2019-11-25 08:58:04,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-25 08:58:04,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-25 08:58:04,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-25 08:58:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:04,559 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-25 08:58:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-25 08:58:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-25 08:58:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:58:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-11-25 08:58:04,563 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-25 08:58:04,563 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-25 08:58:04,563 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:58:04,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-11-25 08:58:04,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-25 08:58:04,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:04,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:04,569 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:04,569 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:58:04,570 INFO L794 eck$LassoCheckResult]: Stem: 413#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 407#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 408#L532 assume !(main_~length1~0 < 1); 409#L532-2 assume !(main_~length2~0 < 1); 401#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 402#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 419#L541-4 main_~i~1 := 0; 405#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 406#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 423#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 422#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 415#L522-5 [2019-11-25 08:58:04,570 INFO L796 eck$LassoCheckResult]: Loop: 415#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 420#L522-1 assume !cstrspn_#t~short7; 421#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 415#L522-5 [2019-11-25 08:58:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2019-11-25 08:58:04,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59891488] [2019-11-25 08:58:04,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:04,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59891488] [2019-11-25 08:58:04,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:04,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:58:04,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069264505] [2019-11-25 08:58:04,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:58:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,695 INFO L82 PathProgramCache]: Analyzing trace with hash 86558, now seen corresponding path program 1 times [2019-11-25 08:58:04,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970528030] [2019-11-25 08:58:04,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:04,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970528030] [2019-11-25 08:58:04,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:04,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:04,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053383964] [2019-11-25 08:58:04,704 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:58:04,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:04,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:04,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:04,704 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-11-25 08:58:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:04,718 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-25 08:58:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:04,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2019-11-25 08:58:04,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-25 08:58:04,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 44 transitions. [2019-11-25 08:58:04,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-25 08:58:04,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-25 08:58:04,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-25 08:58:04,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:04,721 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-25 08:58:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-25 08:58:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-25 08:58:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:58:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-25 08:58:04,724 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-25 08:58:04,724 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-25 08:58:04,724 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:58:04,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-25 08:58:04,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-25 08:58:04,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:04,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:04,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:04,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:58:04,726 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 483#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 484#L532 assume !(main_~length1~0 < 1); 485#L532-2 assume !(main_~length2~0 < 1); 478#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 479#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 493#L541-4 main_~i~1 := 0; 501#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 498#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 476#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 477#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 490#L522-5 [2019-11-25 08:58:04,727 INFO L796 eck$LassoCheckResult]: Loop: 490#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 486#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 487#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 490#L522-5 [2019-11-25 08:58:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 2 times [2019-11-25 08:58:04,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304487583] [2019-11-25 08:58:04,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:04,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304487583] [2019-11-25 08:58:04,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:04,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:58:04,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827512012] [2019-11-25 08:58:04,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:58:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-25 08:58:04,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388030510] [2019-11-25 08:58:04,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:04,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:05,051 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-25 08:58:05,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:58:05,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:58:05,052 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-25 08:58:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:05,130 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-25 08:58:05,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:58:05,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-25 08:58:05,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-25 08:58:05,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 30 transitions. [2019-11-25 08:58:05,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-25 08:58:05,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-25 08:58:05,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-25 08:58:05,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:05,132 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-25 08:58:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-25 08:58:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-25 08:58:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:58:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-11-25 08:58:05,134 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-25 08:58:05,134 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-25 08:58:05,134 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:58:05,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-11-25 08:58:05,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-25 08:58:05,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:05,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:05,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:05,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:05,137 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 559#L532 assume !(main_~length1~0 < 1); 560#L532-2 assume !(main_~length2~0 < 1); 553#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 554#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 566#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 567#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 550#L541-4 main_~i~1 := 0; 551#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 557#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 547#L519-4 [2019-11-25 08:58:05,137 INFO L796 eck$LassoCheckResult]: Loop: 547#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 552#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 565#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 561#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 562#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 548#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 549#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 546#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 547#L519-4 [2019-11-25 08:58:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-25 08:58:05,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994040368] [2019-11-25 08:58:05,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-25 08:58:05,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773693523] [2019-11-25 08:58:05,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,208 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-25 08:58:05,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239486044] [2019-11-25 08:58:05,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:58:05,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239486044] [2019-11-25 08:58:05,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:05,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:58:05,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436928179] [2019-11-25 08:58:05,499 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-25 08:58:05,661 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-25 08:58:05,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:58:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:58:05,662 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-25 08:58:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:05,881 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-25 08:58:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:58:05,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-25 08:58:05,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-25 08:58:05,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 45 transitions. [2019-11-25 08:58:05,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-25 08:58:05,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-25 08:58:05,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-25 08:58:05,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:05,883 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-25 08:58:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-25 08:58:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-25 08:58:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-25 08:58:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-11-25 08:58:05,886 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-25 08:58:05,886 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-25 08:58:05,886 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:58:05,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2019-11-25 08:58:05,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-25 08:58:05,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:05,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:05,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:05,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:05,888 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 647#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 648#L532 assume !(main_~length1~0 < 1); 649#L532-2 assume !(main_~length2~0 < 1); 641#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 642#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 658#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 659#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 636#L541-4 main_~i~1 := 0; 637#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 645#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 635#L519-4 [2019-11-25 08:58:05,888 INFO L796 eck$LassoCheckResult]: Loop: 635#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 638#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 662#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 661#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 654#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 655#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 666#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 664#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 632#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 633#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 634#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 635#L519-4 [2019-11-25 08:58:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-25 08:58:05,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994661094] [2019-11-25 08:58:05,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2019-11-25 08:58:05,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475816124] [2019-11-25 08:58:05,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:05,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2019-11-25 08:58:05,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005074651] [2019-11-25 08:58:05,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:58:06,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005074651] [2019-11-25 08:58:06,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713298612] [2019-11-25 08:58:06,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:06,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:58:06,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:06,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:06,217 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-25 08:58:06,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:06,245 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-25 08:58:06,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:58:06,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-11-25 08:58:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:58:06,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:58:06,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-11-25 08:58:06,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425973569] [2019-11-25 08:58:06,513 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-11-25 08:58:06,725 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-25 08:58:06,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:58:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:58:06,726 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-25 08:58:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:06,885 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-25 08:58:06,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:58:06,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-25 08:58:06,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-25 08:58:06,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 29 transitions. [2019-11-25 08:58:06,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-25 08:58:06,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-25 08:58:06,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-25 08:58:06,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:06,887 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-25 08:58:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-25 08:58:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-25 08:58:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:58:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-25 08:58:06,888 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-25 08:58:06,888 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-25 08:58:06,888 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:58:06,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-25 08:58:06,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-25 08:58:06,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:06,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:06,889 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:06,889 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:06,889 INFO L794 eck$LassoCheckResult]: Stem: 808#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 802#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 803#L532 assume !(main_~length1~0 < 1); 804#L532-2 assume !(main_~length2~0 < 1); 797#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 798#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 810#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 811#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 794#L541-4 main_~i~1 := 0; 795#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 799#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 800#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 801#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 793#L519-4 [2019-11-25 08:58:06,889 INFO L796 eck$LassoCheckResult]: Loop: 793#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 796#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 809#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 805#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 806#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 790#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 791#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 792#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 793#L519-4 [2019-11-25 08:58:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-25 08:58:06,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281826525] [2019-11-25 08:58:06,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:06,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2019-11-25 08:58:06,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688325809] [2019-11-25 08:58:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:06,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2019-11-25 08:58:06,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568378689] [2019-11-25 08:58:06,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:06,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:07,093 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-25 08:58:07,242 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-25 08:58:07,595 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-11-25 08:58:07,742 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-25 08:58:07,744 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:07,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:07,744 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:07,744 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:07,744 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:07,744 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:07,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:07,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:07,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration8_Lasso [2019-11-25 08:58:07,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:07,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:07,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:07,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,142 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-25 08:58:08,304 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-25 08:58:08,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:08,904 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:58:08,905 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,913 INFO L120 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 [2019-11-25 08:58:08,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,920 INFO L120 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 [2019-11-25 08:58:08,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,927 INFO L120 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 [2019-11-25 08:58:08,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,934 INFO L120 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 [2019-11-25 08:58:08,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,945 INFO L120 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 [2019-11-25 08:58:08,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:08,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:08,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:08,960 INFO L120 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 [2019-11-25 08:58:08,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:08,968 INFO L120 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 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:08,976 INFO L120 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 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,983 INFO L120 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 [2019-11-25 08:58:08,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,991 INFO L120 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 [2019-11-25 08:58:08,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:08,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:08,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:08,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:08,998 INFO L120 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 [2019-11-25 08:58:08,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:08,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:08,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:08,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:08,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:09,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:09,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,004 INFO L120 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 [2019-11-25 08:58:09,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:09,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:09,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:09,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:09,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,013 INFO L120 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 [2019-11-25 08:58:09,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:09,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:09,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:09,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,022 INFO L120 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 [2019-11-25 08:58:09,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:09,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:09,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:09,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:09,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,029 INFO L120 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 [2019-11-25 08:58:09,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:09,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:09,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:09,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:09,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,036 INFO L120 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 [2019-11-25 08:58:09,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:09,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:09,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:09,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,050 INFO L120 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 [2019-11-25 08:58:09,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,051 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-25 08:58:09,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,063 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-25 08:58:09,063 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-25 08:58:09,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:09,096 INFO L120 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 [2019-11-25 08:58:09,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:09,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:09,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:09,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:09,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:09,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:58:09,225 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-25 08:58:09,225 INFO L444 ModelExtractionUtils]: 13 out of 55 variables were initially zero. Simplification set additionally 39 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:09,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:09,235 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:58:09,236 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:58:09,236 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3 Supporting invariants [] [2019-11-25 08:58:09,285 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-25 08:58:09,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:58:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:09,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:09,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:09,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:58:09,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:09,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-25 08:58:09,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-25 08:58:09,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 5 states. [2019-11-25 08:58:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:58:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-25 08:58:09,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-25 08:58:09,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:09,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2019-11-25 08:58:09,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:09,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2019-11-25 08:58:09,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:09,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-25 08:58:09,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:09,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 35 transitions. [2019-11-25 08:58:09,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-25 08:58:09,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-25 08:58:09,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-25 08:58:09,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:09,417 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-25 08:58:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-25 08:58:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-25 08:58:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:58:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-25 08:58:09,419 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-25 08:58:09,419 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-25 08:58:09,419 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:58:09,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-25 08:58:09,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:09,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:09,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:09,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:09,421 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:58:09,421 INFO L794 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1008#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1009#L532 assume !(main_~length1~0 < 1); 1010#L532-2 assume !(main_~length2~0 < 1); 1003#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1004#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1019#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1020#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 998#L541-4 main_~i~1 := 0; 999#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1005#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1006#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1007#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1000#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1001#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1017#L522-5 [2019-11-25 08:58:09,421 INFO L796 eck$LassoCheckResult]: Loop: 1017#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1011#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1012#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1017#L522-5 [2019-11-25 08:58:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-25 08:58:09,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:09,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754452217] [2019-11-25 08:58:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:09,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-25 08:58:09,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:09,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625703514] [2019-11-25 08:58:09,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:09,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:09,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-25 08:58:09,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:09,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939149152] [2019-11-25 08:58:09,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:09,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:09,661 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-25 08:58:10,133 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 126 [2019-11-25 08:58:10,298 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-25 08:58:10,300 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:10,300 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:10,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:10,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:10,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:10,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:10,300 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:10,300 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:10,301 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration9_Lasso [2019-11-25 08:58:10,301 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:10,301 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:10,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,754 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-11-25 08:58:10,899 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-25 08:58:10,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:10,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:11,174 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-25 08:58:11,711 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-25 08:58:11,758 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:58:11,759 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:11,769 INFO L120 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 [2019-11-25 08:58:11,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:11,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:11,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,782 INFO L120 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 [2019-11-25 08:58:11,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:11,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:11,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:11,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,789 INFO L120 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 [2019-11-25 08:58:11,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:11,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:11,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,798 INFO L120 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 [2019-11-25 08:58:11,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:11,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:11,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:11,833 INFO L120 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 [2019-11-25 08:58:11,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:11,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,846 INFO L120 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 [2019-11-25 08:58:11,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:11,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:11,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,858 INFO L120 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 [2019-11-25 08:58:11,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:11,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:11,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:11,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:11,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:11,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:11,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:58:11,990 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2019-11-25 08:58:11,991 INFO L444 ModelExtractionUtils]: 23 out of 58 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:11,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:58:11,996 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:58:11,996 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:58:11,996 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4 + 1*ULTIMATE.start_main_~length2~0 >= 0] [2019-11-25 08:58:12,067 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2019-11-25 08:58:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:12,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:58:12,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:12,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:12,127 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-25 08:58:12,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:12,143 INFO L567 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2019-11-25 08:58:12,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:58:12,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2019-11-25 08:58:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:12,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:58:12,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:12,218 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-25 08:58:12,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-25 08:58:12,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 54 states and 67 transitions. Complement of second has 7 states. [2019-11-25 08:58:12,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:58:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-25 08:58:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-25 08:58:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-25 08:58:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-25 08:58:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:12,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2019-11-25 08:58:12,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:12,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2019-11-25 08:58:12,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-25 08:58:12,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-25 08:58:12,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2019-11-25 08:58:12,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:12,287 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-25 08:58:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2019-11-25 08:58:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-25 08:58:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:58:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-25 08:58:12,290 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-25 08:58:12,290 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-25 08:58:12,290 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:58:12,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-25 08:58:12,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:12,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:12,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:12,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:12,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:58:12,292 INFO L794 eck$LassoCheckResult]: Stem: 1284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1277#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1278#L532 assume !(main_~length1~0 < 1); 1279#L532-2 assume !(main_~length2~0 < 1); 1272#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1273#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1287#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1288#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1266#L541-4 main_~i~1 := 0; 1267#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1274#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1275#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1276#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1268#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1269#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1286#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1282#L522-1 assume !cstrspn_#t~short7; 1283#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 1262#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1263#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1264#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1265#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1270#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1285#L522-5 [2019-11-25 08:58:12,292 INFO L796 eck$LassoCheckResult]: Loop: 1285#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1280#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1281#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1285#L522-5 [2019-11-25 08:58:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-25 08:58:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:12,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418702277] [2019-11-25 08:58:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:58:12,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418702277] [2019-11-25 08:58:12,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:12,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:58:12,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937444188] [2019-11-25 08:58:12,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:58:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-25 08:58:12,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:12,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359740350] [2019-11-25 08:58:12,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:12,350 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:12,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:12,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:58:12,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:58:12,490 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-25 08:58:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:12,548 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-11-25 08:58:12,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:58:12,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2019-11-25 08:58:12,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:12,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 39 transitions. [2019-11-25 08:58:12,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-25 08:58:12,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-25 08:58:12,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-25 08:58:12,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:12,550 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-25 08:58:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-25 08:58:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-25 08:58:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:58:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-25 08:58:12,552 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-25 08:58:12,552 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-25 08:58:12,552 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:58:12,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-25 08:58:12,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:12,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:12,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:12,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:12,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:58:12,554 INFO L794 eck$LassoCheckResult]: Stem: 1369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1362#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1363#L532 assume !(main_~length1~0 < 1); 1364#L532-2 assume !(main_~length2~0 < 1); 1357#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1358#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1374#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1375#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1351#L541-4 main_~i~1 := 0; 1352#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1359#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1360#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1361#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1353#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1354#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1372#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1378#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1376#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 1347#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1348#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1349#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1350#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1355#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1370#L522-5 [2019-11-25 08:58:12,554 INFO L796 eck$LassoCheckResult]: Loop: 1370#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1365#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1366#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1370#L522-5 [2019-11-25 08:58:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2019-11-25 08:58:12,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:12,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229496887] [2019-11-25 08:58:12,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:58:12,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229496887] [2019-11-25 08:58:12,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496104051] [2019-11-25 08:58:12,818 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:12,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:58:12,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:58:12,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-25 08:58:12,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:12,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:12,904 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-25 08:58:12,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:12,930 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-25 08:58:12,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:58:12,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-25 08:58:13,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:58:13,115 INFO L343 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2019-11-25 08:58:13,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 58 treesize of output 41 [2019-11-25 08:58:13,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:13,130 INFO L343 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2019-11-25 08:58:13,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 37 [2019-11-25 08:58:13,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:13,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:13,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-25 08:58:13,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:79 [2019-11-25 08:58:13,324 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:13,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2019-11-25 08:58:13,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:58:13,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:58:13,327 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:58:13,357 INFO L567 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2019-11-25 08:58:13,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:58:13,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:58:13,378 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-25 08:58:13,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 08:58:13,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:13,394 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-11-25 08:58:13,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:58:13,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2019-11-25 08:58:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:13,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:58:13,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2019-11-25 08:58:13,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562199502] [2019-11-25 08:58:13,415 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:58:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-25 08:58:13,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846371975] [2019-11-25 08:58:13,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:13,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:13,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 08:58:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:58:13,600 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 19 states. [2019-11-25 08:58:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:14,526 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-11-25 08:58:14,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:58:14,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2019-11-25 08:58:14,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:14,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 35 states and 42 transitions. [2019-11-25 08:58:14,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-25 08:58:14,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-25 08:58:14,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-11-25 08:58:14,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:14,528 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-25 08:58:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-11-25 08:58:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-25 08:58:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:58:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-25 08:58:14,530 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-25 08:58:14,530 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-25 08:58:14,530 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:58:14,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-11-25 08:58:14,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:58:14,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:14,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:14,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:14,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:58:14,531 INFO L794 eck$LassoCheckResult]: Stem: 1587#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1580#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1581#L532 assume !(main_~length1~0 < 1); 1582#L532-2 assume !(main_~length2~0 < 1); 1575#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1576#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1592#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1593#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1595#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1597#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1569#L541-4 main_~i~1 := 0; 1570#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1577#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1578#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1579#L546-4 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 + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1571#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1572#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1590#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1585#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1586#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 1565#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1566#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1567#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1568#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1573#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1588#L522-5 [2019-11-25 08:58:14,531 INFO L796 eck$LassoCheckResult]: Loop: 1588#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1583#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1584#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1588#L522-5 [2019-11-25 08:58:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2019-11-25 08:58:14,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:14,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767074941] [2019-11-25 08:58:14,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:14,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:14,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-25 08:58:14,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:14,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473321887] [2019-11-25 08:58:14,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:14,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-25 08:58:14,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:14,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878682472] [2019-11-25 08:58:14,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:14,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:16,305 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 228 DAG size of output: 179 [2019-11-25 08:58:18,759 WARN L192 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 142 DAG size of output: 142 [2019-11-25 08:58:18,763 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:18,763 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:18,763 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:18,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:18,763 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:18,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:18,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:18,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:18,763 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration12_Lasso [2019-11-25 08:58:18,763 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:18,763 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:18,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:19,119 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 08:58:20,109 WARN L192 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2019-11-25 08:58:20,272 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-25 08:58:20,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:20,462 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-25 08:58:21,034 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-11-25 08:58:21,177 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-25 08:58:21,362 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:58:21,363 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,366 INFO L120 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 [2019-11-25 08:58:21,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,373 INFO L120 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 [2019-11-25 08:58:21,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,380 INFO L120 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 [2019-11-25 08:58:21,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,387 INFO L120 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 [2019-11-25 08:58:21,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:21,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,397 INFO L120 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 [2019-11-25 08:58:21,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:21,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:21,413 INFO L120 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 [2019-11-25 08:58:21,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,424 INFO L120 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 [2019-11-25 08:58:21,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,444 INFO L120 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 [2019-11-25 08:58:21,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,453 INFO L120 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 [2019-11-25 08:58:21,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,464 INFO L120 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 [2019-11-25 08:58:21,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,472 INFO L120 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 [2019-11-25 08:58:21,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:21,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:21,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:21,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,480 INFO L120 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 [2019-11-25 08:58:21,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:21,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,488 INFO L120 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 [2019-11-25 08:58:21,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:21,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,501 INFO L120 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 [2019-11-25 08:58:21,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,503 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-25 08:58:21,503 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-25 08:58:21,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,586 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-25 08:58:21,586 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-25 08:58:21,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:21,791 INFO L120 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 [2019-11-25 08:58:21,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:21,803 INFO L120 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 [2019-11-25 08:58:21,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:21,817 INFO L120 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 [2019-11-25 08:58:21,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:21,828 INFO L120 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 [2019-11-25 08:58:21,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:21,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:21,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:21,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:21,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:21,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:58:21,938 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2019-11-25 08:58:21,938 INFO L444 ModelExtractionUtils]: 3 out of 37 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c09d005-d0a0-4927-86a4-0c218e02dde6/bin/uautomizer/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:21,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:21,946 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:58:21,946 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:58:21,946 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1 Supporting invariants [] [2019-11-25 08:58:22,144 INFO L297 tatePredicateManager]: 33 out of 35 supporting invariants were superfluous and have been removed [2019-11-25 08:58:22,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:58:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:22,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:22,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:22,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-25 08:58:22,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-25 08:58:22,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 50 states and 58 transitions. Complement of second has 7 states. [2019-11-25 08:58:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:58:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-25 08:58:22,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-25 08:58:22,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:22,325 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:58:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:22,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:22,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:22,422 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-25 08:58:22,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-25 08:58:22,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 50 states and 58 transitions. Complement of second has 7 states. [2019-11-25 08:58:22,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:58:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-25 08:58:22,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-25 08:58:22,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:22,478 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:58:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:22,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:58:22,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:22,565 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-25 08:58:22,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-25 08:58:22,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 58 transitions. Complement of second has 6 states. [2019-11-25 08:58:22,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:58:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-25 08:58:22,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-25 08:58:22,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:22,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-25 08:58:22,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:22,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-25 08:58:22,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:22,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2019-11-25 08:58:22,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:58:22,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2019-11-25 08:58:22,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:58:22,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:58:22,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:58:22,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:22,618 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:58:22,618 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:58:22,618 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:58:22,618 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-25 08:58:22,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:58:22,618 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:58:22,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:58:22,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:58:22 BoogieIcfgContainer [2019-11-25 08:58:22,624 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:58:22,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:58:22,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:58:22,624 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:58:22,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:00" (3/4) ... [2019-11-25 08:58:22,627 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:58:22,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:58:22,629 INFO L168 Benchmark]: Toolchain (without parser) took 23510.80 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.7 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). Peak memory consumption was 237.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,629 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:22,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,630 INFO L168 Benchmark]: Boogie Preprocessor took 30.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:22,631 INFO L168 Benchmark]: RCFGBuilder took 369.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,631 INFO L168 Benchmark]: BuchiAutomizer took 22512.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.0 MB). Peak memory consumption was 231.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,631 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:22,633 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 548.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 369.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22512.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.0 MB). Peak memory consumption was 231.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + length2 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s2] and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.4s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 19.3s. Construction of modules took 0.6s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 29 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 251 SDtfs, 669 SDslu, 589 SDs, 0 SdLazy, 671 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital411 mio100 ax107 hnf98 lsp82 ukn67 mio100 lsp43 div108 bol100 ite100 ukn100 eq179 hnf85 smp94 dnf376 smp60 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 279ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...