./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 022e5e55adeb2213dd3e7a54e30f105429bff667 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:44:35,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:44:35,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:44:35,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:44:35,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:44:35,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:44:35,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:44:35,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:44:35,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:44:35,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:44:35,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:44:35,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:44:35,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:44:35,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:44:35,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:44:35,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:44:35,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:44:35,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:44:35,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:44:35,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:44:35,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:44:35,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:44:35,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:44:35,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:44:35,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:44:35,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:44:35,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:44:35,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:44:35,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:44:35,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:44:35,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:44:35,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:44:35,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:44:35,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:44:35,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:44:35,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:44:35,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:44:35,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:44:35,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:44:35,828 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:44:35,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:44:35,829 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:44:35,829 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:44:35,829 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:44:35,829 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:44:35,829 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:44:35,829 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:44:35,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:44:35,830 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:44:35,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:44:35,831 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:44:35,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:44:35,832 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:44:35,832 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:44:35,832 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:44:35,832 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2018-11-10 03:44:35,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:44:35,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:44:35,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:44:35,867 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:44:35,867 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:44:35,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:44:35,902 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/data/257c2975d/e9fd01e261614f79af6e037b3b6af759/FLAGcbf363ec9 [2018-11-10 03:44:36,328 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:44:36,329 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:44:36,335 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/data/257c2975d/e9fd01e261614f79af6e037b3b6af759/FLAGcbf363ec9 [2018-11-10 03:44:36,345 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/data/257c2975d/e9fd01e261614f79af6e037b3b6af759 [2018-11-10 03:44:36,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:44:36,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:44:36,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:44:36,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:44:36,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:44:36,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ceaa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36, skipping insertion in model container [2018-11-10 03:44:36,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:44:36,386 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:44:36,556 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:44:36,563 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:44:36,589 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:44:36,619 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:44:36,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36 WrapperNode [2018-11-10 03:44:36,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:44:36,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:44:36,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:44:36,620 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:44:36,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:44:36,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:44:36,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:44:36,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:44:36,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... [2018-11-10 03:44:36,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:44:36,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:44:36,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:44:36,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:44:36,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:44:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:44:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:44:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:44:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:44:36,954 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:44:36,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:44:36 BoogieIcfgContainer [2018-11-10 03:44:36,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:44:36,955 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:44:36,955 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:44:36,958 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:44:36,958 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:44:36,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:44:36" (1/3) ... [2018-11-10 03:44:36,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b4e7d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:44:36, skipping insertion in model container [2018-11-10 03:44:36,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:44:36,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:44:36" (2/3) ... [2018-11-10 03:44:36,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b4e7d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:44:36, skipping insertion in model container [2018-11-10 03:44:36,960 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:44:36,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:44:36" (3/3) ... [2018-11-10 03:44:36,961 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:44:37,009 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:44:37,009 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:44:37,009 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:44:37,009 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:44:37,010 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:44:37,010 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:44:37,010 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:44:37,010 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:44:37,010 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:44:37,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 03:44:37,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:44:37,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:44:37,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:44:37,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:37,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:37,047 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:44:37,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 03:44:37,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:44:37,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:44:37,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:44:37,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:37,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:37,057 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~ret14, 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; 19#L558true assume !(main_~length1~0 < 1); 23#L558-2true assume !(main_~length2~0 < 1); 17#L561-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 7#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 9#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 22#L567true assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 13#L545-5true [2018-11-10 03:44:37,057 INFO L795 eck$LassoCheckResult]: Loop: 13#L545-5true assume true; 24#L545-1true SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 25#L545-2true assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 20#L547true SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 21#L547-1true cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 29#L548-9true assume !true; 30#L548-10true SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-10 15#L550true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 12#L545-4true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 13#L545-5true [2018-11-10 03:44:37,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 03:44:37,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 03:44:37,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:37,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:44:37,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:44:37,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:44:37,195 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:44:37,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:44:37,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:44:37,205 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 03:44:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:44:37,210 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 03:44:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:44:37,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 03:44:37,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:44:37,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 03:44:37,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 03:44:37,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 03:44:37,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 03:44:37,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:44:37,219 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:44:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 03:44:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 03:44:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 03:44:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 03:44:37,238 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:44:37,238 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:44:37,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:44:37,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 03:44:37,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:44:37,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:44:37,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:44:37,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:37,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:37,240 INFO L793 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~ret14, 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; 64#L558 assume !(main_~length1~0 < 1); 65#L558-2 assume !(main_~length2~0 < 1); 74#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 77#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 78#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 72#L567 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 73#L545-5 [2018-11-10 03:44:37,240 INFO L795 eck$LassoCheckResult]: Loop: 73#L545-5 assume true; 79#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 80#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 66#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 67#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 70#L548-9 assume true; 68#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 69#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 71#L548-3 assume !cstrcspn_#t~short7; 76#L548-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 84#L548-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-10 86#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 85#L545-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 73#L545-5 [2018-11-10 03:44:37,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 03:44:37,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 03:44:37,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:37,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:44:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1600668446, now seen corresponding path program 1 times [2018-11-10 03:44:37,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:37,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:37,451 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-10 03:44:37,689 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 03:44:37,799 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:44:37,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:44:37,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:44:37,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:44:37,801 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:44:37,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:44:37,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:44:37,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:44:37,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 03:44:37,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:44:37,801 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:44:37,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:37,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:37,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:37,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:37,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:37,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:37,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,048 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-10 03:44:38,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:38,527 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:44:38,530 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:44:38,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:38,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:38,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:38,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:38,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:38,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:38,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:38,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:38,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:38,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:38,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:38,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:38,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:38,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:38,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:38,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:38,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:38,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:38,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:38,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:38,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:38,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:38,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:38,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:38,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:38,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:38,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:38,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:38,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:38,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:38,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:38,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:38,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:38,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:38,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:38,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:38,643 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:44:38,660 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:44:38,660 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:44:38,662 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:44:38,663 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:44:38,663 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:44:38,664 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-10 03:44:38,688 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 03:44:38,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:44:38,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:38,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:44:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:38,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:44:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:44:38,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 03:44:38,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 03:44:38,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 38 states and 45 transitions. Complement of second has 7 states. [2018-11-10 03:44:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:44:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:44:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 03:44:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 03:44:38,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:44:38,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 13 letters. [2018-11-10 03:44:38,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:44:38,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 26 letters. [2018-11-10 03:44:38,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:44:38,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2018-11-10 03:44:38,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:44:38,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 35 states and 42 transitions. [2018-11-10 03:44:38,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 03:44:38,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 03:44:38,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-10 03:44:38,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:44:38,865 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 03:44:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-10 03:44:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 03:44:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 03:44:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-10 03:44:38,867 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 03:44:38,867 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 03:44:38,867 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:44:38,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-10 03:44:38,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:44:38,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:44:38,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:44:38,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:38,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:44:38,869 INFO L793 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~ret14, 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; 255#L558 assume !(main_~length1~0 < 1); 256#L558-2 assume !(main_~length2~0 < 1); 271#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 276#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 277#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 269#L567 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 270#L545-5 assume true; 278#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 279#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 257#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 258#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 265#L548-9 [2018-11-10 03:44:38,869 INFO L795 eck$LassoCheckResult]: Loop: 265#L548-9 assume true; 261#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 262#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 267#L548-3 assume !cstrcspn_#t~short7; 273#L548-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 265#L548-9 [2018-11-10 03:44:38,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 03:44:38,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:38,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 03:44:38,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:38,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:38,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:38,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:44:38,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:44:38,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:44:38,908 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:44:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:44:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:44:38,909 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 03:44:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:44:38,923 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-10 03:44:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:44:38,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-10 03:44:38,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:44:38,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-11-10 03:44:38,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:44:38,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 03:44:38,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-10 03:44:38,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:44:38,925 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 03:44:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-10 03:44:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 03:44:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 03:44:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-10 03:44:38,927 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 03:44:38,927 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 03:44:38,927 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:44:38,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-10 03:44:38,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:44:38,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:44:38,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:44:38,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:38,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:38,929 INFO L793 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~ret14, 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; 333#L558 assume !(main_~length1~0 < 1); 334#L558-2 assume !(main_~length2~0 < 1); 349#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 353#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 354#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 347#L567 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 348#L545-5 assume true; 357#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 358#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 335#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 336#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 343#L548-9 [2018-11-10 03:44:38,929 INFO L795 eck$LassoCheckResult]: Loop: 343#L548-9 assume true; 339#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 340#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 345#L548-3 assume cstrcspn_#t~short7; 350#L548-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-4 355#L548-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 361#L548-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 343#L548-9 [2018-11-10 03:44:38,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:38,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 03:44:38,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:38,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:38,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 03:44:38,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:38,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:44:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 03:44:38,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:39,340 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-11-10 03:44:39,434 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:44:39,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:44:39,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:44:39,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:44:39,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:44:39,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:44:39,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:44:39,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:44:39,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 03:44:39,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:44:39,435 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:44:39,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,686 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2018-11-10 03:44:39,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:39,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:44:40,282 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:44:40,282 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:44:40,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:40,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:40,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:40,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:40,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:40,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:40,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:40,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:40,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:40,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:40,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:40,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:40,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:40,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:40,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:44:40,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:44:40,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:44:40,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:40,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:40,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:40,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:40,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:40,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:40,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:40,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:40,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:44:40,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:44:40,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:44:40,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:44:40,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:44:40,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:44:40,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:44:40,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:44:40,334 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:44:40,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:44:40,343 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:44:40,344 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:44:40,344 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:44:40,344 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:44:40,345 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-10 03:44:40,404 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 03:44:40,406 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:44:40,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:44:40,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:44:40,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:40,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:44:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:40,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:44:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:44:40,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:44:40,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:44:40,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 89 states and 100 transitions. Complement of second has 10 states. [2018-11-10 03:44:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:44:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:44:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 03:44:40,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:44:40,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:44:40,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 03:44:40,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:44:40,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 03:44:40,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:44:40,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 100 transitions. [2018-11-10 03:44:40,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:44:40,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 62 states and 70 transitions. [2018-11-10 03:44:40,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 03:44:40,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 03:44:40,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2018-11-10 03:44:40,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:44:40,536 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 03:44:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2018-11-10 03:44:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-11-10 03:44:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:44:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 03:44:40,539 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 03:44:40,539 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 03:44:40,539 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:44:40,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 59 transitions. [2018-11-10 03:44:40,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:44:40,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:44:40,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:44:40,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:40,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:44:40,540 INFO L793 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 655#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~ret14, 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; 625#L558 assume !(main_~length1~0 < 1); 626#L558-2 assume !(main_~length2~0 < 1); 641#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 644#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 645#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 639#L567 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 640#L545-5 assume true; 661#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 673#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 672#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 671#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 658#L548-9 assume true; 663#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 676#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 675#L548-3 assume !cstrcspn_#t~short7; 654#L548-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 664#L548-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-10 662#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 659#L545-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 660#L545-5 assume true; 646#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 647#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 627#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 628#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 635#L548-9 [2018-11-10 03:44:40,541 INFO L795 eck$LassoCheckResult]: Loop: 635#L548-9 assume true; 631#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 632#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 637#L548-3 assume cstrcspn_#t~short7; 642#L548-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-4 650#L548-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 653#L548-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 635#L548-9 [2018-11-10 03:44:40,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2009458362, now seen corresponding path program 2 times [2018-11-10 03:44:40,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:40,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:40,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:40,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:40,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 03:44:40,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:40,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:40,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:40,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:44:40,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:44:40,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:44:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1050967218, now seen corresponding path program 1 times [2018-11-10 03:44:40,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:44:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:44:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:40,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:44:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:44:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:44:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:44:40,649 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_635154bb-55c2-4772-bbbf-0e752c8b30bd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:44:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:44:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:44:40,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:44:40,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 03:44:40,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 03:44:40,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:44:40,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:44:40,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:44:40,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 03:45:21,178 WARN L179 SmtUtils]: Spent 4.32 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 03:45:50,899 WARN L179 SmtUtils]: Spent 5.70 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 03:46:14,964 WARN L179 SmtUtils]: Spent 6.23 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 03:46:14,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 03:46:14,979 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-10 03:46:14,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:46:14,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:46:14,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:46:14,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-10 03:46:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:15,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:46:15,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-10 03:46:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:46:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=222, Unknown=7, NotChecked=0, Total=272 [2018-11-10 03:46:15,136 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. cyclomatic complexity: 10 Second operand 17 states. [2018-11-10 03:46:21,073 WARN L179 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-11-10 03:46:30,661 WARN L179 SmtUtils]: Spent 9.57 s on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-10 03:46:42,539 WARN L179 SmtUtils]: Spent 11.86 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-10 03:46:54,704 WARN L179 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-11-10 03:46:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:54,707 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-10 03:46:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:46:54,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 121 transitions. [2018-11-10 03:46:54,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:46:54,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 88 states and 98 transitions. [2018-11-10 03:46:54,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 03:46:54,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 03:46:54,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2018-11-10 03:46:54,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:46:54,709 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-10 03:46:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2018-11-10 03:46:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-11-10 03:46:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 03:46:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-10 03:46:54,713 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 03:46:54,714 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 03:46:54,714 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:46:54,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-11-10 03:46:54,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:46:54,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:46:54,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:46:54,715 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:54,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:54,716 INFO L793 eck$LassoCheckResult]: Stem: 957#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 956#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~ret14, 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; 925#L558 assume !(main_~length1~0 < 1); 926#L558-2 assume !(main_~length2~0 < 1); 942#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 945#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 946#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 940#L567 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 941#L545-5 assume true; 962#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 973#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 933#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 934#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 972#L548-9 assume true; 929#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 930#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 936#L548-3 assume cstrcspn_#t~short7; 944#L548-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-4 952#L548-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 955#L548-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 966#L548-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-10 963#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 960#L545-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 961#L545-5 assume true; 947#L545-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L545-1 948#L545-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 931#L547 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L547 932#L547-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 937#L548-9 [2018-11-10 03:46:54,716 INFO L795 eck$LassoCheckResult]: Loop: 937#L548-9 assume true; 927#L548-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-1 928#L548-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 935#L548-3 assume cstrcspn_#t~short7; 943#L548-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L548-4 951#L548-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 954#L548-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 937#L548-9 [2018-11-10 03:46:54,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 1 times [2018-11-10 03:46:54,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:54,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:54,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 3 times [2018-11-10 03:46:54,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:54,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:54,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 03:46:54,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:54,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:54,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:46:54,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:54,864 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-10 03:46:55,426 WARN L179 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 148 [2018-11-10 03:46:56,121 WARN L179 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2018-11-10 03:46:56,122 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:46:56,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:46:56,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:46:56,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:46:56,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:46:56,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:46:56,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:46:56,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:46:56,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 03:46:56,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:46:56,123 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:46:56,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 03:46:56,875 WARN L179 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2018-11-10 03:46:56,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:56,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:57,700 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-10 03:46:57,815 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-10 03:46:57,831 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:46:57,831 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:46:57,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:57,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:57,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:57,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,884 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:46:57,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:46:57,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,898 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:46:57,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:46:57,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:57,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:57,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:57,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:57,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:57,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:57,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:57,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:57,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:46:57,949 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:46:57,949 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:46:57,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:46:57,951 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:46:57,951 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:46:57,951 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-10 03:46:58,089 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-10 03:46:58,091 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:46:58,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:58,147 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 [2018-11-10 03:46:58,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 03:46:58,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 92 states and 104 transitions. Complement of second has 9 states. [2018-11-10 03:46:58,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:46:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:46:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-10 03:46:58,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:46:58,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:58,204 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:46:58,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:58,282 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 [2018-11-10 03:46:58,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 03:46:58,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 92 states and 104 transitions. Complement of second has 9 states. [2018-11-10 03:46:58,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:46:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:46:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-10 03:46:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:46:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:58,332 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:46:58,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:58,397 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 [2018-11-10 03:46:58,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 03:46:58,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 99 states and 114 transitions. Complement of second has 8 states. [2018-11-10 03:46:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:46:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:46:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-10 03:46:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:46:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 03:46:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 03:46:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:58,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 114 transitions. [2018-11-10 03:46:58,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:46:58,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-11-10 03:46:58,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:46:58,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:46:58,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:46:58,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:46:58,446 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:46:58,446 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:46:58,446 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:46:58,446 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:46:58,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:46:58,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:46:58,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:46:58,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:46:58 BoogieIcfgContainer [2018-11-10 03:46:58,454 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:46:58,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:46:58,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:46:58,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:46:58,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:44:36" (3/4) ... [2018-11-10 03:46:58,458 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:46:58,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:46:58,458 INFO L168 Benchmark]: Toolchain (without parser) took 142110.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.6 MB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -288.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:58,459 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:58,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.86 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 935.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:58,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -219.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:58,461 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:58,462 INFO L168 Benchmark]: RCFGBuilder took 242.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:58,462 INFO L168 Benchmark]: BuchiAutomizer took 141498.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:58,464 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:58,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.86 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 935.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -219.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 242.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 141498.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.71 ms. Allocated memory is still 1.3 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * s and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 141.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 101.0s. Construction of modules took 0.1s. Büchi inclusion checks took 40.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 200 SDtfs, 384 SDslu, 313 SDs, 0 SdLazy, 279 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital353 mio100 ax100 hnf99 lsp91 ukn92 mio100 lsp31 div115 bol100 ite100 ukn100 eq184 hnf82 smp86 dnf760 smp50 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...