./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-678e011 [2019-11-20 09:03:34,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:03:34,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:03:34,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:03:34,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:03:34,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:03:34,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:03:34,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:03:34,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:03:34,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:03:34,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:03:34,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:03:34,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:03:34,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:03:34,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:03:34,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:03:34,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:03:34,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:03:34,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:03:34,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:03:34,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:03:34,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:03:34,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:03:34,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:03:34,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:03:34,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:03:34,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:03:34,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:03:34,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:03:34,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:03:34,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:03:34,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:03:34,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:03:34,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:03:34,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:03:34,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:03:34,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:03:34,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:03:34,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:03:34,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:03:34,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:03:34,078 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 09:03:34,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:03:34,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:03:34,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:03:34,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:03:34,094 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:03:34,095 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 09:03:34,095 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 09:03:34,095 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 09:03:34,095 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 09:03:34,095 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 09:03:34,095 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 09:03:34,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:03:34,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:03:34,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 09:03:34,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:03:34,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:03:34,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:03:34,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 09:03:34,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 09:03:34,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 09:03:34,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:03:34,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:03:34,098 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 09:03:34,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:03:34,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 09:03:34,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:03:34,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:03:34,099 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 09:03:34,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:03:34,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:03:34,099 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 09:03:34,100 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 09:03:34,100 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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:34,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:03:34,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:03:34,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:03:34,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:03:34,253 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:03:34,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-11-20 09:03:34,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/data/889dda5b3/14cc387da5984d2e988dbfdbfabcf25a/FLAGcc6c801b1 [2019-11-20 09:03:34,815 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:03:34,818 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-11-20 09:03:34,834 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/data/889dda5b3/14cc387da5984d2e988dbfdbfabcf25a/FLAGcc6c801b1 [2019-11-20 09:03:35,323 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/bin/uautomizer/data/889dda5b3/14cc387da5984d2e988dbfdbfabcf25a [2019-11-20 09:03:35,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:03:35,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:03:35,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:03:35,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:03:35,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:03:35,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35, skipping insertion in model container [2019-11-20 09:03:35,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,339 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:03:35,373 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:03:35,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:03:35,696 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:03:35,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:03:35,825 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:03:35,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35 WrapperNode [2019-11-20 09:03:35,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:03:35,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:03:35,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:03:35,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:03:35,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:03:35,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:03:35,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:03:35,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:03:35,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... [2019-11-20 09:03:35,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:03:35,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:03:35,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:03:35,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:03:35,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 09:03:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 09:03:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:03:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:03:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:03:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:03:36,300 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:03:36,300 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-20 09:03:36,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:03:36 BoogieIcfgContainer [2019-11-20 09:03:36,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:03:36,302 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 09:03:36,302 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 09:03:36,305 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 09:03:36,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 09:03:36,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 09:03:35" (1/3) ... [2019-11-20 09:03:36,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cfaee03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:03:36, skipping insertion in model container [2019-11-20 09:03:36,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 09:03:36,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:35" (2/3) ... [2019-11-20 09:03:36,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cfaee03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:03:36, skipping insertion in model container [2019-11-20 09:03:36,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 09:03:36,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:03:36" (3/3) ... [2019-11-20 09:03:36,309 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-1.i [2019-11-20 09:03:36,345 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 09:03:36,345 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 09:03:36,345 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 09:03:36,345 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:03:36,345 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:03:36,345 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 09:03:36,346 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:03:36,346 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 09:03:36,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-20 09:03:36,374 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-20 09:03:36,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:36,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:36,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 09:03:36,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 09:03:36,379 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 09:03:36,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-20 09:03:36,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-20 09:03:36,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:36,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:36,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 09:03:36,382 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 09:03:36,387 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-20 09:03:36,388 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-20 09:03:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-20 09:03:36,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:36,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504014456] [2019-11-20 09:03:36,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:36,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-20 09:03:36,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:36,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24596089] [2019-11-20 09:03:36,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:36,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:36,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-20 09:03:36,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:36,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748736032] [2019-11-20 09:03:36,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:36,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:36,834 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-20 09:03:36,927 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 09:03:36,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 09:03:36,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 09:03:36,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 09:03:36,928 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 09:03:36,928 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:36,928 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 09:03:36,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 09:03:36,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration1_Lasso [2019-11-20 09:03:36,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 09:03:36,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 09:03:36,961 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-20 09:03:36,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-20 09:03:36,970 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-20 09:03:36,972 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-20 09:03:36,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-20 09:03:36,980 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-20 09:03:37,124 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-20 09:03:37,148 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-20 09:03:37,151 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-20 09:03:37,157 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-20 09:03:37,171 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-20 09:03:37,173 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-20 09:03:37,177 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-20 09:03:37,180 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-20 09:03:37,185 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-20 09:03:37,189 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-20 09:03:37,572 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 09:03:37,577 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:37,584 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-20 09:03:37,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:37,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:37,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:37,612 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-20 09:03:37,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:37,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:37,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:37,633 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-20 09:03:37,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:37,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:37,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:37,659 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:37,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:37,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:37,682 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-20 09:03:37,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:37,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:37,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,698 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-20 09:03:37,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:37,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:37,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,730 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-20 09:03:37,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:37,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:37,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,766 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-20 09:03:37,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:37,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:37,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:37,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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:37,792 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-20 09:03:37,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:37,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:37,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:37,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:37,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:37,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:37,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 09:03:37,941 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-20 09:03:37,942 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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:37,970 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-20 09:03:37,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 09:03:37,978 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 09:03:37,978 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-20 09:03:38,002 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-20 09:03:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:38,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:03:38,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:38,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 09:03:38,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:38,090 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-20 09:03:38,106 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-20 09:03:38,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-20 09:03:38,165 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-20 09:03:38,165 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-20 09:03:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 09:03:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-20 09:03:38,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-20 09:03:38,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:38,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-20 09:03:38,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:38,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-20 09:03:38,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:38,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-20 09:03:38,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 09:03:38,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2019-11-20 09:03:38,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-20 09:03:38,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-20 09:03:38,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-20 09:03:38,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:38,181 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-20 09:03:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-20 09:03:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-20 09:03:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 09:03:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-20 09:03:38,207 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-20 09:03:38,207 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-20 09:03:38,207 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 09:03:38,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-20 09:03:38,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 09:03:38,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:38,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:38,208 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:38,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 09:03:38,209 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-20 09:03:38,209 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-20 09:03:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-20 09:03:38,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:38,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584826862] [2019-11-20 09:03:38,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:38,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-20 09:03:38,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:38,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351846669] [2019-11-20 09:03:38,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:38,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-20 09:03:38,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:38,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561523317] [2019-11-20 09:03:38,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:38,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:38,594 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-20 09:03:38,683 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 09:03:38,684 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 09:03:38,684 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 09:03:38,684 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 09:03:38,684 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 09:03:38,684 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:38,684 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 09:03:38,685 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 09:03:38,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration2_Lasso [2019-11-20 09:03:38,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 09:03:38,685 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 09:03:38,689 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-20 09:03:38,697 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-20 09:03:38,700 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-20 09:03:38,703 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-20 09:03:38,706 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-20 09:03:38,709 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-20 09:03:38,715 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-20 09:03:38,719 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-20 09:03:38,721 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-20 09:03:38,724 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-20 09:03:38,880 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-20 09:03:38,913 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-20 09:03:38,918 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-20 09:03:38,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-20 09:03:38,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-20 09:03:39,222 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 09:03:39,222 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:39,230 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-20 09:03:39,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:39,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:39,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:39,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:39,249 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-20 09:03:39,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:39,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:39,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:39,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:39,266 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-20 09:03:39,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:39,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:39,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:39,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,282 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-20 09:03:39,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:39,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:39,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,306 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-20 09:03:39,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:39,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:39,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:39,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,327 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-20 09:03:39,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:39,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:39,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,356 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-20 09:03:39,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:39,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:39,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,374 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-20 09:03:39,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:39,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:39,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:39,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,390 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-20 09:03:39,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:39,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:39,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,418 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-20 09:03:39,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:39,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:39,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:39,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:39,441 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-20 09:03:39,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:39,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:39,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:39,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:39,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:39,452 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-20 09:03:39,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 09:03:39,504 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-20 09:03:39,504 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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:39,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 09:03:39,514 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 09:03:39,514 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 09:03:39,515 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2019-11-20 09:03:39,543 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2019-11-20 09:03:39,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 09:03:39,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:39,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 09:03:39,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:39,616 WARN L253 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 09:03:39,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:39,630 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-20 09:03:39,630 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-20 09:03:39,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-20 09:03:39,703 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-20 09:03:39,704 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-20 09:03:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 09:03:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-20 09:03:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-20 09:03:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-20 09:03:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-20 09:03:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:39,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-20 09:03:39,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-20 09:03:39,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-20 09:03:39,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-20 09:03:39,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-20 09:03:39,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-20 09:03:39,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:39,709 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-20 09:03:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-20 09:03:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-20 09:03:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 09:03:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-20 09:03:39,711 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-20 09:03:39,711 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-20 09:03:39,711 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 09:03:39,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-20 09:03:39,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-20 09:03:39,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:39,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:39,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:39,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:39,713 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-20 09:03:39,714 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-20 09:03:39,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:39,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667903661] [2019-11-20 09:03:39,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:39,749 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-20 09:03:39,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:39,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564402783] [2019-11-20 09:03:39,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:39,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-20 09:03:39,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917286936] [2019-11-20 09:03:39,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:40,014 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-20 09:03:40,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917286936] [2019-11-20 09:03:40,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:03:40,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 09:03:40,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673082424] [2019-11-20 09:03:40,153 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-20 09:03:40,367 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-20 09:03:40,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:03:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:03:40,371 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-20 09:03:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:40,672 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-11-20 09:03:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 09:03:40,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-20 09:03:40,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-20 09:03:40,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2019-11-20 09:03:40,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-20 09:03:40,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-20 09:03:40,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-20 09:03:40,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:40,679 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-20 09:03:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-20 09:03:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-20 09:03:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 09:03:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-11-20 09:03:40,684 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-20 09:03:40,684 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-20 09:03:40,684 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 09:03:40,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-11-20 09:03:40,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-20 09:03:40,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:40,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:40,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:40,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 09:03:40,687 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-20 09:03:40,687 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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-20 09:03:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2019-11-20 09:03:40,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:40,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964566216] [2019-11-20 09:03:40,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:40,787 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-20 09:03:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964566216] [2019-11-20 09:03:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:03:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 09:03:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705483345] [2019-11-20 09:03:40,788 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 09:03:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 86558, now seen corresponding path program 1 times [2019-11-20 09:03:40,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:40,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900687266] [2019-11-20 09:03:40,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:40,805 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-20 09:03:40,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900687266] [2019-11-20 09:03:40,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:03:40,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:03:40,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868986567] [2019-11-20 09:03:40,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 09:03:40,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:40,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:03:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:03:40,807 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-11-20 09:03:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:40,821 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-20 09:03:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:03:40,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2019-11-20 09:03:40,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-20 09:03:40,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 44 transitions. [2019-11-20 09:03:40,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-20 09:03:40,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-20 09:03:40,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-20 09:03:40,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:40,824 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-20 09:03:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-20 09:03:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-20 09:03:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 09:03:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-20 09:03:40,827 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-20 09:03:40,827 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-20 09:03:40,827 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 09:03:40,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-20 09:03:40,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-20 09:03:40,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:40,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:40,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:40,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 09:03:40,829 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-20 09:03:40,829 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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-20 09:03:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 2 times [2019-11-20 09:03:40,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:40,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644279585] [2019-11-20 09:03:40,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:40,967 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-20 09:03:40,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644279585] [2019-11-20 09:03:40,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:03:40,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 09:03:40,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681758833] [2019-11-20 09:03:40,968 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 09:03:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-20 09:03:40,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:40,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552183551] [2019-11-20 09:03:40,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:40,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:41,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:03:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:03:41,126 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-20 09:03:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:41,194 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-20 09:03:41,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:03:41,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-20 09:03:41,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-20 09:03:41,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 30 transitions. [2019-11-20 09:03:41,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-20 09:03:41,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-20 09:03:41,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-20 09:03:41,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:41,197 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-20 09:03:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-20 09:03:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-20 09:03:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 09:03:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-11-20 09:03:41,199 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-20 09:03:41,199 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-20 09:03:41,199 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 09:03:41,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-11-20 09:03:41,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-20 09:03:41,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:41,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:41,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:41,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:41,201 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-20 09:03:41,201 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-20 09:03:41,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:41,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500682830] [2019-11-20 09:03:41,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,228 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-20 09:03:41,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:41,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878747870] [2019-11-20 09:03:41,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-20 09:03:41,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:41,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662159252] [2019-11-20 09:03:41,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:41,379 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-20 09:03:41,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662159252] [2019-11-20 09:03:41,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:03:41,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 09:03:41,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279225928] [2019-11-20 09:03:41,487 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-20 09:03:41,666 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-20 09:03:41,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:03:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:03:41,667 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-20 09:03:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:41,889 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-20 09:03:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 09:03:41,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-20 09:03:41,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-20 09:03:41,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 45 transitions. [2019-11-20 09:03:41,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-20 09:03:41,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-20 09:03:41,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-20 09:03:41,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:41,892 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-20 09:03:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-20 09:03:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-20 09:03:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 09:03:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-11-20 09:03:41,895 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-20 09:03:41,895 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-20 09:03:41,895 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 09:03:41,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2019-11-20 09:03:41,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-20 09:03:41,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:41,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:41,896 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:41,896 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:41,897 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-20 09:03:41,897 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-20 09:03:41,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:41,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173469415] [2019-11-20 09:03:41,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2019-11-20 09:03:41,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:41,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955565740] [2019-11-20 09:03:41,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:41,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2019-11-20 09:03:41,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:41,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468384338] [2019-11-20 09:03:41,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:42,100 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-20 09:03:42,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468384338] [2019-11-20 09:03:42,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573104530] [2019-11-20 09:03:42,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:42,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 09:03:42,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:42,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:03:42,234 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-20 09:03:42,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:03:42,247 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 09:03:42,247 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-20 09:03:42,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-11-20 09:03:42,324 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-20 09:03:42,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:03:42,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-11-20 09:03:42,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348638150] [2019-11-20 09:03:42,496 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-11-20 09:03:42,716 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-20 09:03:42,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 09:03:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-20 09:03:42,717 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-20 09:03:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:42,891 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-20 09:03:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 09:03:42,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-20 09:03:42,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-20 09:03:42,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 29 transitions. [2019-11-20 09:03:42,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-20 09:03:42,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-20 09:03:42,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-20 09:03:42,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:42,893 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-20 09:03:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-20 09:03:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-20 09:03:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 09:03:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-20 09:03:42,895 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-20 09:03:42,896 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-20 09:03:42,896 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 09:03:42,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-20 09:03:42,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-20 09:03:42,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:42,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:42,897 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:42,897 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:42,897 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-20 09:03:42,897 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-20 09:03:42,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:42,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653314201] [2019-11-20 09:03:42,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:42,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2019-11-20 09:03:42,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:42,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146433492] [2019-11-20 09:03:42,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:42,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2019-11-20 09:03:42,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:42,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056959819] [2019-11-20 09:03:42,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:42,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:43,101 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-20 09:03:43,248 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-20 09:03:43,613 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-11-20 09:03:43,775 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-20 09:03:43,777 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 09:03:43,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 09:03:43,777 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 09:03:43,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 09:03:43,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 09:03:43,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:43,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 09:03:43,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 09:03:43,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration8_Lasso [2019-11-20 09:03:43,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 09:03:43,778 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 09:03:43,783 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-20 09:03:43,786 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-20 09:03:43,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-20 09:03:43,789 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-20 09:03:43,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-20 09:03:43,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-20 09:03:43,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-20 09:03:43,796 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-20 09:03:43,798 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-20 09:03:43,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-20 09:03:43,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-20 09:03:43,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-20 09:03:43,805 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-20 09:03:43,807 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-20 09:03:43,809 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-20 09:03:43,811 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-20 09:03:43,820 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-20 09:03:44,205 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-20 09:03:44,381 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-20 09:03:44,381 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-20 09:03:44,384 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-20 09:03:44,386 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-20 09:03:44,388 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-20 09:03:44,390 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-20 09:03:44,392 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-20 09:03:44,394 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-20 09:03:44,398 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-20 09:03:45,039 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 09:03:45,040 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:45,058 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-20 09:03:45,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,068 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-20 09:03:45,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:45,086 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-20 09:03:45,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:45,098 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-20 09:03:45,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,110 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-20 09:03:45,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:45,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:45,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,133 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-20 09:03:45,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,140 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-20 09:03:45,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,148 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-20 09:03:45,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,155 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-20 09:03:45,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,163 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-20 09:03:45,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,169 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-20 09:03:45,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,184 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-20 09:03:45,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,199 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-20 09:03:45,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:45,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:45,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:45,217 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-20 09:03:45,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,226 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-20 09:03:45,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:45,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:45,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:45,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,234 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-20 09:03:45,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:45,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:45,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,247 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-20 09:03:45,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,249 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-20 09:03:45,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,261 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-20 09:03:45,261 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-20 09:03:45,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:45,294 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-20 09:03:45,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:45,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:45,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:45,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:45,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:45,310 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-20 09:03:45,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 09:03:45,408 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-20 09:03:45,408 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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:45,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 09:03:45,413 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 09:03:45,414 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 09:03:45,414 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-20 09:03:45,465 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-20 09:03:45,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 09:03:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:45,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:45,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:45,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 09:03:45,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:45,543 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-20 09:03:45,543 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-20 09:03:45,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 09:03:45,579 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-20 09:03:45,579 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-20 09:03:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 09:03:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-20 09:03:45,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-20 09:03:45,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:45,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2019-11-20 09:03:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:45,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2019-11-20 09:03:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:45,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-20 09:03:45,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:45,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 35 transitions. [2019-11-20 09:03:45,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 09:03:45,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 09:03:45,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-20 09:03:45,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 09:03:45,583 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-20 09:03:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-20 09:03:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 09:03:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 09:03:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-20 09:03:45,585 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-20 09:03:45,585 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-20 09:03:45,585 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 09:03:45,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-20 09:03:45,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:45,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:45,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:45,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:03:45,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 09:03:45,586 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-20 09:03:45,586 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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-20 09:03:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-20 09:03:45,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:45,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156513377] [2019-11-20 09:03:45,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:45,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-20 09:03:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:45,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344379486] [2019-11-20 09:03:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:45,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-20 09:03:45,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:45,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480627242] [2019-11-20 09:03:45,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:45,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:46,300 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 126 [2019-11-20 09:03:46,466 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-20 09:03:46,468 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 09:03:46,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 09:03:46,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 09:03:46,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 09:03:46,468 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 09:03:46,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:46,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 09:03:46,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 09:03:46,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration9_Lasso [2019-11-20 09:03:46,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 09:03:46,468 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 09:03:46,472 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-20 09:03:46,473 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-20 09:03:46,475 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-20 09:03:46,909 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-11-20 09:03:47,062 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-20 09:03:47,063 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-20 09:03:47,064 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-20 09:03:47,066 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-20 09:03:47,068 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-20 09:03:47,070 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-20 09:03:47,071 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-20 09:03:47,073 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-20 09:03:47,079 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-20 09:03:47,082 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-20 09:03:47,084 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-20 09:03:47,085 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-20 09:03:47,087 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-20 09:03:47,090 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-20 09:03:47,091 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-20 09:03:47,093 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-20 09:03:47,095 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-20 09:03:47,097 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-20 09:03:47,099 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-20 09:03:47,101 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-20 09:03:47,103 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-20 09:03:47,105 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-20 09:03:47,108 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-20 09:03:47,368 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-20 09:03:47,909 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-20 09:03:47,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 09:03:47,958 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:47,962 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-20 09:03:47,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:47,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:47,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:47,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:47,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:47,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:47,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:47,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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:47,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 [2019-11-20 09:03:47,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:47,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:47,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:47,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:47,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:47,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:47,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:47,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:47,975 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-20 09:03:47,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:47,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:47,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:47,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:47,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:47,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:47,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:47,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-20 09:03:47,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:47,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:47,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:47,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:47,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:47,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:48,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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:48,005 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-20 09:03:48,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:48,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:48,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:48,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:48,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:48,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:48,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:48,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-20 09:03:48,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:48,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:48,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:48,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:48,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:48,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:48,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:48,034 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-20 09:03:48,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:48,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:48,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:48,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:48,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:48,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:48,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 09:03:48,166 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2019-11-20 09:03:48,167 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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:48,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 09:03:48,176 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 09:03:48,176 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 09:03:48,177 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-20 09:03:48,279 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2019-11-20 09:03:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:48,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 09:03:48,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:48,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:03:48,352 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-20 09:03:48,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:03:48,368 INFO L567 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2019-11-20 09:03:48,368 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-20 09:03:48,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2019-11-20 09:03:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:48,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 09:03:48,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:48,416 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-20 09:03:48,417 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-20 09:03:48,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-20 09:03:48,477 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-20 09:03:48,480 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-20 09:03:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 09:03:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-20 09:03:48,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-20 09:03:48,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:48,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-20 09:03:48,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:48,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-20 09:03:48,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:48,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2019-11-20 09:03:48,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:48,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2019-11-20 09:03:48,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-20 09:03:48,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-20 09:03:48,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2019-11-20 09:03:48,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 09:03:48,483 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-20 09:03:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2019-11-20 09:03:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-20 09:03:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 09:03:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-20 09:03:48,485 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-20 09:03:48,485 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-20 09:03:48,485 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 09:03:48,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-20 09:03:48,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:48,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:48,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:48,486 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-20 09:03:48,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 09:03:48,487 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:48,487 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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-20 09:03:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-20 09:03:48,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:48,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106940015] [2019-11-20 09:03:48,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:48,545 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-20 09:03:48,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106940015] [2019-11-20 09:03:48,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:03:48,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 09:03:48,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649888437] [2019-11-20 09:03:48,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 09:03:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-20 09:03:48,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:48,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476315425] [2019-11-20 09:03:48,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:48,552 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:48,729 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-20 09:03:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:03:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:03:48,730 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-20 09:03:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:48,810 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-11-20 09:03:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:03:48,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2019-11-20 09:03:48,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:48,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 39 transitions. [2019-11-20 09:03:48,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 09:03:48,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 09:03:48,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-20 09:03:48,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 09:03:48,812 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-20 09:03:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-20 09:03:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-20 09:03:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 09:03:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-20 09:03:48,814 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-20 09:03:48,815 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-20 09:03:48,815 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 09:03:48,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-20 09:03:48,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:48,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:48,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:48,816 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-20 09:03:48,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 09:03:48,816 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:48,816 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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-20 09:03:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2019-11-20 09:03:48,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:48,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954020753] [2019-11-20 09:03:48,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:49,099 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-20 09:03:49,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954020753] [2019-11-20 09:03:49,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849714923] [2019-11-20 09:03:49,099 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:49,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 09:03:49,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 09:03:49,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-20 09:03:49,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:49,182 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:03:49,183 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-20 09:03:49,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:03:49,202 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-20 09:03:49,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:03:49,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-20 09:03:49,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:03:49,431 INFO L343 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2019-11-20 09:03:49,431 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-20 09:03:49,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:03:49,463 INFO L343 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2019-11-20 09:03:49,463 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-20 09:03:49,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:03:49,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:03:49,498 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-20 09:03:49,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:79 [2019-11-20 09:03:49,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:03:49,641 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-20 09:03:49,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:03:49,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:03:49,645 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-20 09:03:49,677 INFO L567 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2019-11-20 09:03:49,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 09:03:49,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 09:03:49,706 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-20 09:03:49,707 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-20 09:03:49,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:03:49,736 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-11-20 09:03:49,737 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-20 09:03:49,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2019-11-20 09:03:49,769 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-20 09:03:49,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:03:49,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2019-11-20 09:03:49,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374186184] [2019-11-20 09:03:49,770 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 09:03:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-20 09:03:49,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:49,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881826768] [2019-11-20 09:03:49,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:49,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:49,977 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-20 09:03:49,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:03:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 09:03:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-20 09:03:49,978 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 19 states. [2019-11-20 09:03:50,749 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 09:03:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:03:50,999 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-11-20 09:03:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 09:03:51,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2019-11-20 09:03:51,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:51,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 35 states and 42 transitions. [2019-11-20 09:03:51,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 09:03:51,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 09:03:51,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-11-20 09:03:51,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 09:03:51,002 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-20 09:03:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-11-20 09:03:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-20 09:03:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 09:03:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-20 09:03:51,004 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-20 09:03:51,004 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-20 09:03:51,004 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 09:03:51,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-11-20 09:03:51,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 09:03:51,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 09:03:51,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 09:03:51,005 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-20 09:03:51,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 09:03:51,006 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 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-20 09:03:51,006 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~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;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-20 09:03:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2019-11-20 09:03:51,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:51,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812449362] [2019-11-20 09:03:51,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:51,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:51,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:51,037 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-20 09:03:51,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:51,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344439388] [2019-11-20 09:03:51,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:51,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:51,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-20 09:03:51,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:03:51,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935051331] [2019-11-20 09:03:51,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:03:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:03:51,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:03:52,667 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 228 DAG size of output: 179 [2019-11-20 09:03:55,070 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 142 DAG size of output: 142 [2019-11-20 09:03:55,072 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 09:03:55,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 09:03:55,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 09:03:55,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 09:03:55,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 09:03:55,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:55,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 09:03:55,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 09:03:55,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration12_Lasso [2019-11-20 09:03:55,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 09:03:55,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 09:03:55,079 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-20 09:03:55,085 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-20 09:03:55,087 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-20 09:03:55,089 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-20 09:03:55,092 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-20 09:03:55,095 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-20 09:03:55,097 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-20 09:03:55,101 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-20 09:03:55,102 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-20 09:03:55,104 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-20 09:03:55,105 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-20 09:03:55,107 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-20 09:03:55,439 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-20 09:03:56,503 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 137 DAG size of output: 112 [2019-11-20 09:03:56,677 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-20 09:03:56,677 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-20 09:03:56,679 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-20 09:03:56,680 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-20 09:03:56,682 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-20 09:03:56,683 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-20 09:03:56,684 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-20 09:03:56,686 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-20 09:03:56,688 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-20 09:03:56,689 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-20 09:03:56,691 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-20 09:03:56,693 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-20 09:03:56,694 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-20 09:03:56,696 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-20 09:03:56,698 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-20 09:03:56,862 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-20 09:03:57,105 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-20 09:03:57,541 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-11-20 09:03:57,691 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-20 09:03:57,814 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-20 09:03:57,939 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 09:03:57,939 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:57,943 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-20 09:03:57,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:57,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:57,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:57,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:57,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:57,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:57,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:57,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:57,963 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-20 09:03:57,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:57,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:57,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:57,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:57,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:57,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:57,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:57,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:57,969 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-20 09:03:57,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:57,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:57,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:57,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:57,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:57,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:57,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:57,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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:57,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 [2019-11-20 09:03:57,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:57,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:57,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:57,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:57,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:57,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:57,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:57,985 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-20 09:03:57,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:57,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:57,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:57,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:57,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:57,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:57,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:57,995 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-20 09:03:57,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:57,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:57,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:57,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:57,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:57,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,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_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,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-20 09:03:58,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:58,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:58,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:58,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,015 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-20 09:03:58,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:58,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:58,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:58,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) [2019-11-20 09:03:58,027 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:58,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:58,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:58,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:58,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,037 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-20 09:03:58,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:58,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:58,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:58,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,047 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-20 09:03:58,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 09:03:58,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 09:03:58,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 09:03:58,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,056 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-20 09:03:58,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:58,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,067 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-20 09:03:58,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:58,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,082 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-20 09:03:58,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,084 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-20 09:03:58,084 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-20 09:03:58,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,194 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-20 09:03:58,194 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-20 09:03:58,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:58,336 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-20 09:03:58,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:58,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:58,345 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-20 09:03:58,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:58,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:58,360 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-20 09:03:58,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:58,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 09:03:58,372 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-20 09:03:58,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 09:03:58,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 09:03:58,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 09:03:58,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 09:03:58,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 09:03:58,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 09:03:58,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 09:03:58,512 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2019-11-20 09:03:58,513 INFO L444 ModelExtractionUtils]: 10 out of 61 variables were initially zero. Simplification set additionally 48 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4bc2605-1502-4cd2-8e4c-3db94d2fd690/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-20 09:03:58,522 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-20 09:03:58,524 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 09:03:58,525 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 09:03:58,525 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-20 09:03:58,742 INFO L297 tatePredicateManager]: 33 out of 35 supporting invariants were superfluous and have been removed [2019-11-20 09:03:58,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 09:03:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:58,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:58,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:58,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:58,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:58,862 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-20 09:03:58,863 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-20 09:03:58,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-20 09:03:58,924 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-20 09:03:58,924 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-20 09:03:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 09:03:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-20 09:03:58,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 09:03:58,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:58,925 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 09:03:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:58,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:58,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:59,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:59,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:59,068 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-20 09:03:59,068 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-20 09:03:59,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-20 09:03:59,139 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-20 09:03:59,140 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-20 09:03:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 09:03:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-20 09:03:59,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 09:03:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:59,141 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 09:03:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:03:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:59,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:59,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:03:59,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:03:59,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:03:59,260 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-20 09:03:59,261 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-20 09:03:59,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-20 09:03:59,301 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-20 09:03:59,301 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-20 09:03:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 09:03:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-20 09:03:59,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 09:03:59,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:59,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-20 09:03:59,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:59,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-20 09:03:59,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 09:03:59,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2019-11-20 09:03:59,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 09:03:59,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2019-11-20 09:03:59,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 09:03:59,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 09:03:59,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 09:03:59,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 09:03:59,304 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:03:59,304 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:03:59,304 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:03:59,304 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 09:03:59,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:03:59,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 09:03:59,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 09:03:59,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 09:03:59 BoogieIcfgContainer [2019-11-20 09:03:59,310 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 09:03:59,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:03:59,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:03:59,311 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:03:59,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:03:36" (3/4) ... [2019-11-20 09:03:59,314 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 09:03:59,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:03:59,314 INFO L168 Benchmark]: Toolchain (without parser) took 23988.20 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 266.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:03:59,315 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:03:59,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 09:03:59,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.00 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-20 09:03:59,316 INFO L168 Benchmark]: Boogie Preprocessor took 27.53 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-20 09:03:59,316 INFO L168 Benchmark]: RCFGBuilder took 395.63 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:03:59,316 INFO L168 Benchmark]: BuchiAutomizer took 23008.43 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.0 MB). Peak memory consumption was 268.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:03:59,316 INFO L168 Benchmark]: Witness Printer took 3.07 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-20 09:03:59,318 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 498.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.00 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. * Boogie Preprocessor took 27.53 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 395.63 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23008.43 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.0 MB). Peak memory consumption was 268.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.07 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 unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * i 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 unknown-#length-unknown[nondetString2] + -1 * s 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.9s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 19.7s. Construction of modules took 0.6s. Büchi inclusion checks took 2.3s. 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, 645 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 lsp44 div105 bol100 ite100 ukn100 eq179 hnf88 smp97 dnf315 smp60 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 251ms 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...