./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6e748b563bb7a11726b28f7957ce1a00b7c8807b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:26:27,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:26:27,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:26:27,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:26:27,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:26:27,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:26:27,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:26:27,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:26:27,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:26:27,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:26:27,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:26:27,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:26:27,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:26:27,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:26:27,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:26:27,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:26:27,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:26:27,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:26:27,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:26:27,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:26:27,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:26:27,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:26:27,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:26:27,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:26:27,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:26:27,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:26:27,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:26:27,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:26:27,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:26:27,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:26:27,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:26:27,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:26:27,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:26:27,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:26:27,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:26:27,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:26:27,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:26:27,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:26:27,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:26:27,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:26:27,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:26:27,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:26:27,721 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:26:27,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:26:27,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:26:27,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:26:27,723 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:26:27,723 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:26:27,723 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:26:27,724 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:26:27,724 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:26:27,724 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:26:27,725 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:26:27,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:26:27,725 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:26:27,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:26:27,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:26:27,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:26:27,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:26:27,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:26:27,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:26:27,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:26:27,727 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:26:27,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:26:27,728 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:26:27,728 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:26:27,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:26:27,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:26:27,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:26:27,729 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:26:27,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:26:27,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:26:27,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:26:27,731 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:26:27,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:26:27,732 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2020-10-19 20:26:28,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:26:28,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:26:28,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:26:28,054 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:26:28,054 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:26:28,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2020-10-19 20:26:28,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538552464/e19896285705476cb3c814fa207722e1/FLAG1974d5bff [2020-10-19 20:26:28,625 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:26:28,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2020-10-19 20:26:28,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538552464/e19896285705476cb3c814fa207722e1/FLAG1974d5bff [2020-10-19 20:26:28,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538552464/e19896285705476cb3c814fa207722e1 [2020-10-19 20:26:29,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:26:29,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:26:29,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:26:29,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:26:29,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:26:29,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:26:28" (1/1) ... [2020-10-19 20:26:29,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618d9b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29, skipping insertion in model container [2020-10-19 20:26:29,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:26:28" (1/1) ... [2020-10-19 20:26:29,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:26:29,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:26:29,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:26:29,452 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:26:29,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:26:29,551 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:26:29,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29 WrapperNode [2020-10-19 20:26:29,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:26:29,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:26:29,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:26:29,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:26:29,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:26:29,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:26:29,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:26:29,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:26:29,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... [2020-10-19 20:26:29,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:26:29,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:26:29,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:26:29,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:26:29,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-19 20:26:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:26:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:26:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:26:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:26:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:26:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:26:30,026 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:26:30,027 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-19 20:26:30,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:26:30 BoogieIcfgContainer [2020-10-19 20:26:30,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:26:30,029 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:26:30,029 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:26:30,033 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:26:30,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:26:30,034 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:26:28" (1/3) ... [2020-10-19 20:26:30,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4537edc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:26:30, skipping insertion in model container [2020-10-19 20:26:30,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:26:30,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:29" (2/3) ... [2020-10-19 20:26:30,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4537edc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:26:30, skipping insertion in model container [2020-10-19 20:26:30,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:26:30,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:26:30" (3/3) ... [2020-10-19 20:26:30,038 INFO L373 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2020-10-19 20:26:30,080 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:26:30,081 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:26:30,081 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:26:30,081 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:26:30,081 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:26:30,082 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:26:30,082 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:26:30,082 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:26:30,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-10-19 20:26:30,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:26:30,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:30,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:30,127 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:26:30,127 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:30,127 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:26:30,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-10-19 20:26:30,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:26:30,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:30,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:30,131 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:26:30,131 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:30,139 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 15#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 11#L535-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 24#L541-3true [2020-10-19 20:26:30,140 INFO L796 eck$LassoCheckResult]: Loop: 24#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 21#L541-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 24#L541-3true [2020-10-19 20:26:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-19 20:26:30,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:30,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169002876] [2020-10-19 20:26:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:30,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:30,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:30,304 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:30,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-19 20:26:30,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:30,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157540875] [2020-10-19 20:26:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:30,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:30,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:30,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-19 20:26:30,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:30,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200056457] [2020-10-19 20:26:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:30,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:30,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:30,381 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:30,620 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-19 20:26:30,717 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:30,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:30,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:30,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:30,719 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:30,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:30,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:30,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2020-10-19 20:26:30,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:30,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:30,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:30,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:31,271 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:31,276 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:31,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:31,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:31,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:31,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:31,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:31,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:31,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:31,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:31,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:31,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:31,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:31,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:31,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:31,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:31,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:31,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:31,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:31,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:31,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:31,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:31,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:31,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:31,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:31,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:31,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:31,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:31,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:31,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:31,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:31,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:32,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:32,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:32,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:32,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:32,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:32,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:32,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:32,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:32,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:32,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:32,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:32,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:32,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:32,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:32,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:32,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:32,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:32,127 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 20:26:32,127 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:32,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:32,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:32,150 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:32,151 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-19 20:26:32,297 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-19 20:26:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:32,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:26:32,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:32,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:26:32,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:32,415 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:26:32,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 3 states. [2020-10-19 20:26:32,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 3 states. Result 57 states and 84 transitions. Complement of second has 7 states. [2020-10-19 20:26:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:26:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-10-19 20:26:32,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 20:26:32,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:32,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-19 20:26:32,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:32,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-19 20:26:32,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:32,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2020-10-19 20:26:32,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-19 20:26:32,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2020-10-19 20:26:32,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:26:32,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:26:32,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-10-19 20:26:32,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:32,572 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-19 20:26:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-10-19 20:26:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-19 20:26:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 20:26:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-10-19 20:26:32,604 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-19 20:26:32,604 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-19 20:26:32,605 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:26:32,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-10-19 20:26:32,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-19 20:26:32,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:32,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:32,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:32,609 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:32,610 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 164#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 165#L532 assume !(main_~length1~0 < 1); 166#L532-2 assume !(main_~length2~0 < 1); 161#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 162#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 154#L541-4 main_~i~1 := 0; 155#L547-3 [2020-10-19 20:26:32,610 INFO L796 eck$LassoCheckResult]: Loop: 155#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 160#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 155#L547-3 [2020-10-19 20:26:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-19 20:26:32,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:32,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799523496] [2020-10-19 20:26:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-19 20:26:32,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:32,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700843500] [2020-10-19 20:26:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,703 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:32,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-10-19 20:26:32,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:32,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267761275] [2020-10-19 20:26:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:32,942 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-19 20:26:33,000 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:33,000 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:33,000 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:33,000 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:33,000 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:33,001 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,001 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:33,001 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:33,001 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2020-10-19 20:26:33,001 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:33,001 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:33,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:33,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:33,446 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:33,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:33,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:33,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:33,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:33,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:33,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:33,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:33,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:33,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:33,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:33,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:33,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:33,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:33,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:33,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:33,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:33,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:33,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:33,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:33,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:33,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:33,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:33,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:33,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:33,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:33,940 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:33,971 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 20:26:33,971 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:33,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:33,985 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:33,986 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:33,986 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2020-10-19 20:26:34,022 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-19 20:26:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:34,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:26:34,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:34,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:26:34,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:34,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:26:34,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-19 20:26:34,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 42 transitions. Complement of second has 6 states. [2020-10-19 20:26:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:26:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-10-19 20:26:34,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-19 20:26:34,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:34,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-19 20:26:34,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:34,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-19 20:26:34,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:34,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2020-10-19 20:26:34,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 20:26:34,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2020-10-19 20:26:34,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:26:34,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:26:34,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-10-19 20:26:34,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:34,102 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-19 20:26:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-10-19 20:26:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-19 20:26:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:26:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-10-19 20:26:34,104 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-19 20:26:34,105 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-19 20:26:34,105 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:26:34,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-10-19 20:26:34,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 20:26:34,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:34,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:34,107 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:34,107 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:34,107 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 287#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 288#L532 assume !(main_~length1~0 < 1); 289#L532-2 assume !(main_~length2~0 < 1); 284#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 285#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 276#L541-4 main_~i~1 := 0; 277#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 286#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 279#L517-3 [2020-10-19 20:26:34,108 INFO L796 eck$LassoCheckResult]: Loop: 279#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 274#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 275#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 278#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 291#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 280#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 281#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 279#L517-3 [2020-10-19 20:26:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-10-19 20:26:34,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:34,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467126324] [2020-10-19 20:26:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2020-10-19 20:26:34,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:34,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82929175] [2020-10-19 20:26:34,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2020-10-19 20:26:34,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:34,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787155021] [2020-10-19 20:26:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:34,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787155021] [2020-10-19 20:26:34,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:26:34,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-19 20:26:34,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685494710] [2020-10-19 20:26:34,552 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-10-19 20:26:34,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:26:34,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:26:34,602 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-10-19 20:26:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:34,686 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-10-19 20:26:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:26:34,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2020-10-19 20:26:34,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 20:26:34,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 28 transitions. [2020-10-19 20:26:34,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:26:34,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:26:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-10-19 20:26:34,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:34,690 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-19 20:26:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-10-19 20:26:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-19 20:26:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:26:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-10-19 20:26:34,693 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-19 20:26:34,693 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-19 20:26:34,693 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:26:34,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-10-19 20:26:34,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 20:26:34,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:34,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:34,695 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:34,695 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:34,695 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 351#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 352#L532 assume !(main_~length1~0 < 1); 353#L532-2 assume !(main_~length2~0 < 1); 348#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 349#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 356#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 357#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 340#L541-4 main_~i~1 := 0; 341#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 350#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 343#L517-3 [2020-10-19 20:26:34,696 INFO L796 eck$LassoCheckResult]: Loop: 343#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 338#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 339#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 342#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 355#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 344#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 345#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 343#L517-3 [2020-10-19 20:26:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-19 20:26:34,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:34,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045102210] [2020-10-19 20:26:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,742 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2020-10-19 20:26:34,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:34,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779819846] [2020-10-19 20:26:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:34,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:34,760 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2020169960, now seen corresponding path program 1 times [2020-10-19 20:26:34,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:34,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421420161] [2020-10-19 20:26:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:34,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421420161] [2020-10-19 20:26:34,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:26:34,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-19 20:26:34,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534712734] [2020-10-19 20:26:35,036 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-10-19 20:26:35,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:26:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:26:35,075 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-10-19 20:26:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:35,259 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-10-19 20:26:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:26:35,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2020-10-19 20:26:35,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-19 20:26:35,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 42 transitions. [2020-10-19 20:26:35,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-19 20:26:35,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-19 20:26:35,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2020-10-19 20:26:35,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:35,264 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 20:26:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2020-10-19 20:26:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-19 20:26:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:26:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-10-19 20:26:35,270 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-19 20:26:35,271 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-19 20:26:35,271 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:26:35,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2020-10-19 20:26:35,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-19 20:26:35,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:35,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:35,276 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:35,277 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:35,277 INFO L794 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 430#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 431#L532 assume !(main_~length1~0 < 1); 432#L532-2 assume !(main_~length2~0 < 1); 426#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 427#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 436#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 437#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 416#L541-4 main_~i~1 := 0; 417#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 428#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 419#L517-3 [2020-10-19 20:26:35,278 INFO L796 eck$LassoCheckResult]: Loop: 419#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 420#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 440#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 434#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 435#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 438#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 444#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 443#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 442#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 441#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 419#L517-3 [2020-10-19 20:26:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2020-10-19 20:26:35,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:35,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767943189] [2020-10-19 20:26:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:35,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:35,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:35,335 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1312710103, now seen corresponding path program 1 times [2020-10-19 20:26:35,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:35,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793844519] [2020-10-19 20:26:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:35,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:35,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:35,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1844492576, now seen corresponding path program 1 times [2020-10-19 20:26:35,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:35,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205767447] [2020-10-19 20:26:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:35,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205767447] [2020-10-19 20:26:35,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029489685] [2020-10-19 20:26:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:26:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:35,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-19 20:26:35,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:35,656 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:35,657 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:26:35,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:35,670 INFO L625 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-10-19 20:26:35,672 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:35,673 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-10-19 20:26:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:35,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:26:35,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2020-10-19 20:26:35,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774006031] [2020-10-19 20:26:36,030 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2020-10-19 20:26:36,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:36,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:26:36,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-19 20:26:36,081 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand 9 states. [2020-10-19 20:26:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:36,244 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-19 20:26:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:26:36,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-19 20:26:36,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 20:26:36,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 27 transitions. [2020-10-19 20:26:36,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:26:36,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:26:36,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-10-19 20:26:36,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:36,247 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-10-19 20:26:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-10-19 20:26:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-19 20:26:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:26:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-19 20:26:36,250 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:26:36,250 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:26:36,250 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:26:36,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-19 20:26:36,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 20:26:36,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:36,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:36,251 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:36,251 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:36,251 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 577#L532 assume !(main_~length1~0 < 1); 578#L532-2 assume !(main_~length2~0 < 1); 573#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 574#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 581#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 582#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 565#L541-4 main_~i~1 := 0; 566#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 571#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 572#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 575#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 568#L517-3 [2020-10-19 20:26:36,251 INFO L796 eck$LassoCheckResult]: Loop: 568#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 563#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 564#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 567#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 580#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 569#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 570#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 568#L517-3 [2020-10-19 20:26:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-19 20:26:36,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:36,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077878338] [2020-10-19 20:26:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:36,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:36,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:36,274 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2020-10-19 20:26:36,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:36,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700860067] [2020-10-19 20:26:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:36,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:36,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:36,286 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2020-10-19 20:26:36,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:36,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546542062] [2020-10-19 20:26:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:36,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:36,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:36,317 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:36,426 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-10-19 20:26:37,028 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2020-10-19 20:26:37,275 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-19 20:26:37,278 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:37,278 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:37,278 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:37,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:37,278 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:37,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:37,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:37,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:37,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2020-10-19 20:26:37,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:37,279 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:37,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:37,837 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-10-19 20:26:38,011 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2020-10-19 20:26:38,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:38,346 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-19 20:26:38,889 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-10-19 20:26:38,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:38,932 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:38,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:38,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:38,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:38,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:38,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:38,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:38,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:38,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:38,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:38,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:38,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:38,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:38,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:38,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:38,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:38,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:38,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:38,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:38,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:38,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:38,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:38,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:38,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:38,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:38,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:38,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:39,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:39,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:39,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:39,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:39,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:39,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:39,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:39,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:39,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:39,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:39,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:39,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:39,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:39,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:39,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:39,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:39,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:39,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:39,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:39,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:39,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:39,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:39,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:39,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:39,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:39,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:39,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:39,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:39,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:39,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:39,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:39,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:39,391 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-19 20:26:39,391 INFO L444 ModelExtractionUtils]: 45 out of 64 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:39,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:39,397 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:39,397 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:39,397 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2020-10-19 20:26:39,485 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-10-19 20:26:39,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:39,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:39,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:39,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:26:39,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:39,572 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 [2020-10-19 20:26:39,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 20:26:39,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 36 transitions. Complement of second has 5 states. [2020-10-19 20:26:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:26:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-10-19 20:26:39,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 7 letters. [2020-10-19 20:26:39,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:39,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 7 letters. [2020-10-19 20:26:39,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:39,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 14 letters. [2020-10-19 20:26:39,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:39,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-10-19 20:26:39,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:39,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2020-10-19 20:26:39,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 20:26:39,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:39,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-19 20:26:39,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:39,629 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-19 20:26:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-19 20:26:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-19 20:26:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:26:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-10-19 20:26:39,632 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-19 20:26:39,632 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-19 20:26:39,632 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:26:39,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2020-10-19 20:26:39,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:39,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:39,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:39,634 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:39,634 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:39,635 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 783#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 784#L532 assume !(main_~length1~0 < 1); 785#L532-2 assume !(main_~length2~0 < 1); 780#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 781#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 789#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 790#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 770#L541-4 main_~i~1 := 0; 771#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 778#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 779#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 782#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 774#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 766#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 767#L520-5 [2020-10-19 20:26:39,635 INFO L796 eck$LassoCheckResult]: Loop: 767#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 772#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 787#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 767#L520-5 [2020-10-19 20:26:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2020-10-19 20:26:39,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:39,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398031535] [2020-10-19 20:26:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:39,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:39,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:39,659 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:39,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:39,659 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2020-10-19 20:26:39,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:39,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172263349] [2020-10-19 20:26:39,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:39,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:39,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:39,668 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2020-10-19 20:26:39,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:39,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923680422] [2020-10-19 20:26:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:39,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:39,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:39,697 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:40,556 WARN L193 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 130 [2020-10-19 20:26:40,820 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-19 20:26:40,822 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:40,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:40,823 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:40,823 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:40,823 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:40,823 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:40,823 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:40,823 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:40,823 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2020-10-19 20:26:40,823 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:40,823 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:40,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:40,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,467 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2020-10-19 20:26:41,711 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-10-19 20:26:41,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:41,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:42,063 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-10-19 20:26:42,691 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:42,692 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:42,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:42,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:42,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:42,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:42,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:42,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:42,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:42,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:42,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:42,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:42,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:42,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:42,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:42,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:42,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:42,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:42,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:42,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:42,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:42,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:42,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:42,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:42,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:42,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:42,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:42,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:42,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:42,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:42,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:42,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:42,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:42,980 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 20:26:42,981 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 20:26:42,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:42,991 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-19 20:26:42,991 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 20:26:43,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:43,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:43,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:43,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:43,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:43,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:43,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:43,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:43,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:43,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:43,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:43,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:43,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:43,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:43,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:43,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:43,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:43,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:43,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:43,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:43,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:43,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:43,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:43,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:43,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:43,223 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-10-19 20:26:43,223 INFO L444 ModelExtractionUtils]: 24 out of 64 variables were initially zero. Simplification set additionally 37 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:43,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:43,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:43,229 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:43,229 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_4, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_4 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2020-10-19 20:26:43,396 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2020-10-19 20:26:43,400 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:43,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:43,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:43,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:26:43,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:43,500 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 [2020-10-19 20:26:43,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-10-19 20:26:43,567 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 7 states. [2020-10-19 20:26:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:26:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-19 20:26:43,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 20:26:43,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:43,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-19 20:26:43,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:43,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-19 20:26:43,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:43,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2020-10-19 20:26:43,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:43,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 36 states and 48 transitions. [2020-10-19 20:26:43,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:26:43,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 20:26:43,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2020-10-19 20:26:43,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:43,571 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-10-19 20:26:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2020-10-19 20:26:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-10-19 20:26:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:26:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-19 20:26:43,574 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-19 20:26:43,574 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-19 20:26:43,574 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:26:43,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-19 20:26:43,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:43,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:43,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:43,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:43,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:43,576 INFO L794 eck$LassoCheckResult]: Stem: 1075#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1072#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1073#L532 assume !(main_~length1~0 < 1); 1074#L532-2 assume !(main_~length2~0 < 1); 1069#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1070#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1079#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1080#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1058#L541-4 main_~i~1 := 0; 1059#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1067#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1068#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1071#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1064#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1065#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1082#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1077#L520-1 assume !substring_#t~short6; 1078#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 1062#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1063#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1066#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1054#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1055#L520-5 [2020-10-19 20:26:43,577 INFO L796 eck$LassoCheckResult]: Loop: 1055#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1060#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1076#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1055#L520-5 [2020-10-19 20:26:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1389384631, now seen corresponding path program 1 times [2020-10-19 20:26:43,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:43,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554963263] [2020-10-19 20:26:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 20:26:43,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554963263] [2020-10-19 20:26:43,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:26:43,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:26:43,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204698145] [2020-10-19 20:26:43,610 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:26:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 2 times [2020-10-19 20:26:43,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:43,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217204612] [2020-10-19 20:26:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:43,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:43,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:43,619 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:43,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:26:43,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:26:43,716 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-10-19 20:26:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:43,764 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2020-10-19 20:26:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:26:43,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2020-10-19 20:26:43,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-19 20:26:43,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 44 transitions. [2020-10-19 20:26:43,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:26:43,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 20:26:43,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-10-19 20:26:43,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:43,767 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 20:26:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-10-19 20:26:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-19 20:26:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:26:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-10-19 20:26:43,773 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 20:26:43,773 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 20:26:43,773 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:26:43,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-10-19 20:26:43,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:43,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:43,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:43,775 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:43,776 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:43,776 INFO L794 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1150#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1151#L532 assume !(main_~length1~0 < 1); 1152#L532-2 assume !(main_~length2~0 < 1); 1147#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1148#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1157#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1158#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1136#L541-4 main_~i~1 := 0; 1137#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1145#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1146#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1149#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1140#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1141#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1162#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1161#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1160#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 1143#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1144#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1142#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1132#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1133#L520-5 [2020-10-19 20:26:43,776 INFO L796 eck$LassoCheckResult]: Loop: 1133#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1138#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1154#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1133#L520-5 [2020-10-19 20:26:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1446642933, now seen corresponding path program 2 times [2020-10-19 20:26:43,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:43,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071896297] [2020-10-19 20:26:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:44,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071896297] [2020-10-19 20:26:44,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836270942] [2020-10-19 20:26:44,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:26:44,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:26:44,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:26:44,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 20:26:44,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:44,099 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-10-19 20:26:44,100 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:44,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:44,104 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:44,105 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-10-19 20:26:44,195 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-10-19 20:26:44,195 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:44,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:44,208 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 20:26:44,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2020-10-19 20:26:44,367 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:44,367 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-10-19 20:26:44,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-19 20:26:44,384 INFO L625 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-10-19 20:26:44,386 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:44,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2020-10-19 20:26:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:44,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:26:44,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-10-19 20:26:44,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109286749] [2020-10-19 20:26:44,393 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:26:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 3 times [2020-10-19 20:26:44,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:44,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613478260] [2020-10-19 20:26:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:44,506 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-19 20:26:44,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-19 20:26:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-10-19 20:26:44,534 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 15 states. [2020-10-19 20:26:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:45,002 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-10-19 20:26:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:26:45,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 65 transitions. [2020-10-19 20:26:45,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:45,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 45 transitions. [2020-10-19 20:26:45,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:26:45,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:45,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2020-10-19 20:26:45,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:45,005 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-19 20:26:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2020-10-19 20:26:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-10-19 20:26:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-19 20:26:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-19 20:26:45,008 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 20:26:45,009 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 20:26:45,009 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:26:45,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-10-19 20:26:45,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:45,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:45,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:45,011 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:45,011 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:45,011 INFO L794 eck$LassoCheckResult]: Stem: 1331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1328#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1329#L532 assume !(main_~length1~0 < 1); 1330#L532-2 assume !(main_~length2~0 < 1); 1325#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1326#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1334#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1335#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1336#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1337#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1313#L541-4 main_~i~1 := 0; 1314#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1323#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1324#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1327#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1320#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1311#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1312#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1317#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1338#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 1318#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1319#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1321#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1309#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1310#L520-5 [2020-10-19 20:26:45,011 INFO L796 eck$LassoCheckResult]: Loop: 1310#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1315#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1332#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1310#L520-5 [2020-10-19 20:26:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1546919447, now seen corresponding path program 3 times [2020-10-19 20:26:45,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:45,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190200567] [2020-10-19 20:26:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:45,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:45,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:45,061 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 4 times [2020-10-19 20:26:45,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:45,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629856388] [2020-10-19 20:26:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:45,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:45,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:45,069 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash 721898201, now seen corresponding path program 1 times [2020-10-19 20:26:45,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:45,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759048430] [2020-10-19 20:26:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:45,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:45,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:45,117 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:46,823 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 236 DAG size of output: 180 [2020-10-19 20:26:47,179 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-19 20:26:47,182 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:47,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:47,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:47,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:47,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:47,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:47,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:47,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:47,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration10_Lasso [2020-10-19 20:26:47,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:47,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:47,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:47,943 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 112 [2020-10-19 20:26:48,191 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-10-19 20:26:48,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:48,645 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-10-19 20:26:49,070 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-19 20:26:49,678 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-10-19 20:26:49,744 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:49,744 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:49,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:49,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:49,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:49,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:49,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:49,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:49,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:49,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:49,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:49,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:49,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:49,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:49,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:49,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:49,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:49,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:49,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:49,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:49,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:49,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:49,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:49,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:49,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:49,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:49,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:49,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:49,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:49,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:49,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:49,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:50,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:50,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:50,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:50,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:50,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:50,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:50,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:50,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:50,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:50,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:50,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:50,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:50,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:50,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:50,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:50,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:50,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:50,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:50,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:50,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:50,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:50,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:50,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:50,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:50,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:50,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:50,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:50,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:50,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:50,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:50,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:50,263 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-19 20:26:50,263 INFO L444 ModelExtractionUtils]: 10 out of 58 variables were initially zero. Simplification set additionally 45 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:50,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:50,276 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:50,276 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:50,276 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2020-10-19 20:26:50,623 INFO L297 tatePredicateManager]: 38 out of 40 supporting invariants were superfluous and have been removed [2020-10-19 20:26:50,629 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:50,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 20:26:50,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:50,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:50,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:50,754 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 [2020-10-19 20:26:50,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-19 20:26:50,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 52 states and 66 transitions. Complement of second has 9 states. [2020-10-19 20:26:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 20:26:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-10-19 20:26:50,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 20:26:50,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:50,847 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:50,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 20:26:50,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:50,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:50,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:50,957 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 [2020-10-19 20:26:50,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-19 20:26:51,039 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 52 states and 66 transitions. Complement of second has 9 states. [2020-10-19 20:26:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 20:26:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-10-19 20:26:51,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 20:26:51,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:51,043 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:51,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 20:26:51,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:51,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:51,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:51,178 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 [2020-10-19 20:26:51,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-19 20:26:51,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 60 states and 78 transitions. Complement of second has 8 states. [2020-10-19 20:26:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 20:26:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-10-19 20:26:51,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 20:26:51,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:51,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-19 20:26:51,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:51,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 24 letters. Loop has 6 letters. [2020-10-19 20:26:51,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:51,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2020-10-19 20:26:51,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:51,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 66 transitions. [2020-10-19 20:26:51,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:26:51,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:26:51,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2020-10-19 20:26:51,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:51,289 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-10-19 20:26:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2020-10-19 20:26:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-10-19 20:26:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-19 20:26:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2020-10-19 20:26:51,298 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-10-19 20:26:51,298 INFO L594 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-10-19 20:26:51,298 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:26:51,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2020-10-19 20:26:51,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:51,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:51,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:51,300 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:51,301 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:51,301 INFO L794 eck$LassoCheckResult]: Stem: 2004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2001#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 2002#L532 assume !(main_~length1~0 < 1); 2003#L532-2 assume !(main_~length2~0 < 1); 1998#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1999#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 2008#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 2009#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 2011#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 2013#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1985#L541-4 main_~i~1 := 0; 1986#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1996#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1997#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 2000#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1991#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1992#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 2027#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 2014#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 2012#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3; 1994#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1995#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1993#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1981#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1982#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1988#L520-1 [2020-10-19 20:26:51,301 INFO L796 eck$LassoCheckResult]: Loop: 1988#L520-1 assume !substring_#t~short6; 2005#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1987#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1988#L520-1 [2020-10-19 20:26:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash -709862543, now seen corresponding path program 4 times [2020-10-19 20:26:51,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:51,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220459058] [2020-10-19 20:26:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:51,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:51,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:51,372 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 92531, now seen corresponding path program 1 times [2020-10-19 20:26:51,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:51,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688604087] [2020-10-19 20:26:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:26:51,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688604087] [2020-10-19 20:26:51,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:26:51,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:26:51,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389929210] [2020-10-19 20:26:51,385 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:26:51,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:51,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:26:51,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:26:51,385 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-10-19 20:26:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:51,396 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-10-19 20:26:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:26:51,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2020-10-19 20:26:51,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:26:51,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2020-10-19 20:26:51,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:26:51,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:26:51,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:26:51,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:51,398 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:26:51,398 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:26:51,398 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:26:51,398 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:26:51,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:26:51,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:26:51,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:26:51,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:26:51 BoogieIcfgContainer [2020-10-19 20:26:51,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:26:51,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:26:51,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:26:51,407 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:26:51,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:26:30" (3/4) ... [2020-10-19 20:26:51,411 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:26:51,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:26:51,412 INFO L168 Benchmark]: Toolchain (without parser) took 22411.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.0 MB). Free memory was 960.0 MB in the beginning and 992.0 MB in the end (delta: -32.0 MB). Peak memory consumption was 454.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:51,413 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:26:51,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:51,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:51,414 INFO L168 Benchmark]: Boogie Preprocessor took 31.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:26:51,414 INFO L168 Benchmark]: RCFGBuilder took 395.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:51,414 INFO L168 Benchmark]: BuchiAutomizer took 21375.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.1 GB in the beginning and 992.0 MB in the end (delta: 85.2 MB). Peak memory consumption was 438.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:51,415 INFO L168 Benchmark]: Witness Printer took 4.41 ms. Allocated memory is still 1.5 GB. Free memory is still 992.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:26:51,417 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 395.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21375.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.1 GB in the beginning and 992.0 MB in the end (delta: 85.2 MB). Peak memory consumption was 438.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.41 ms. Allocated memory is still 1.5 GB. Free memory is still 992.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps2 and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.3s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 18.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 235 SDtfs, 420 SDslu, 496 SDs, 0 SdLazy, 459 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax108 hnf98 lsp88 ukn69 mio100 lsp50 div100 bol100 ite100 ukn100 eq184 hnf90 smp97 dnf131 smp93 tf100 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...