./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/openbsd_cstrpbrk-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 b05f810cf5c3fdbb476cd22f2154f4cd5a41b63d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:18:46,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:18:46,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:18:46,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:18:46,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:18:46,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:18:46,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:18:46,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:18:46,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:18:46,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:18:46,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:18:46,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:18:46,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:18:46,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:18:46,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:18:46,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:18:46,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:18:46,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:18:46,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:18:46,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:18:46,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:18:46,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:18:46,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:18:46,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:18:46,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:18:46,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:18:46,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:18:46,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:18:46,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:18:46,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:18:46,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:18:46,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:18:46,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:18:46,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:18:46,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:18:46,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:18:46,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:18:46,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:18:46,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:18:46,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:18:46,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:18:46,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:18:46,616 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:18:46,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:18:46,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:18:46,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:18:46,619 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:18:46,619 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:18:46,619 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:18:46,620 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:18:46,620 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:18:46,620 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:18:46,621 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:18:46,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:18:46,621 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:18:46,622 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:18:46,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:18:46,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:18:46,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:18:46,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:18:46,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:18:46,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:18:46,623 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:18:46,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:18:46,623 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:18:46,624 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:18:46,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:18:46,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:18:46,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:18:46,624 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:18:46,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:18:46,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:18:46,625 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:18:46,625 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:18:46,626 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:18:46,626 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 -> b05f810cf5c3fdbb476cd22f2154f4cd5a41b63d [2020-10-20 08:18:46,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:18:46,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:18:46,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:18:46,844 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:18:46,844 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:18:46,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2020-10-20 08:18:46,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad4e617b/0e83b00dfee84cbb89a470d643583a9c/FLAGc05a908ec [2020-10-20 08:18:47,529 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:18:47,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2020-10-20 08:18:47,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad4e617b/0e83b00dfee84cbb89a470d643583a9c/FLAGc05a908ec [2020-10-20 08:18:47,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad4e617b/0e83b00dfee84cbb89a470d643583a9c [2020-10-20 08:18:47,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:18:47,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:18:47,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:18:47,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:18:47,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:18:47,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:18:47" (1/1) ... [2020-10-20 08:18:47,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37558f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:47, skipping insertion in model container [2020-10-20 08:18:47,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:18:47" (1/1) ... [2020-10-20 08:18:47,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:18:47,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:18:48,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:18:48,336 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:18:48,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:18:48,439 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:18:48,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48 WrapperNode [2020-10-20 08:18:48,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:18:48,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:18:48,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:18:48,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:18:48,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:18:48,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:18:48,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:18:48,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:18:48,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (1/1) ... [2020-10-20 08:18:48,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:18:48,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:18:48,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:18:48,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:18:48,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (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-20 08:18:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:18:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:18:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:18:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:18:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:18:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:18:48,917 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:18:48,918 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 08:18:48,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:48 BoogieIcfgContainer [2020-10-20 08:18:48,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:18:48,920 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:18:48,932 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:18:48,937 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:18:48,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:48,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:18:47" (1/3) ... [2020-10-20 08:18:48,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e07496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:18:48, skipping insertion in model container [2020-10-20 08:18:48,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:48,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:48" (2/3) ... [2020-10-20 08:18:48,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e07496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:18:48, skipping insertion in model container [2020-10-20 08:18:48,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:48,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:48" (3/3) ... [2020-10-20 08:18:48,946 INFO L373 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2020-10-20 08:18:48,992 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:18:48,993 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:18:48,993 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:18:48,993 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:18:48,994 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:18:48,994 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:18:48,994 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:18:48,994 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:18:49,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 08:18:49,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-20 08:18:49,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:49,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:49,043 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:18:49,043 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:49,044 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:18:49,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 08:18:49,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-20 08:18:49,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:49,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:49,047 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:18:49,047 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:49,056 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 19#L528true assume !(main_~length1~0 < 1); 5#L528-2true assume !(main_~length2~0 < 1); 15#L531-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 9#L537-3true [2020-10-20 08:18:49,056 INFO L796 eck$LassoCheckResult]: Loop: 9#L537-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 8#L537-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 9#L537-3true [2020-10-20 08:18:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-20 08:18:49,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:49,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306806251] [2020-10-20 08:18:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:49,172 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:49,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:49,214 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-20 08:18:49,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:49,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747590021] [2020-10-20 08:18:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:49,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:49,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:49,236 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-20 08:18:49,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:49,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369119446] [2020-10-20 08:18:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:49,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:49,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:49,294 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:49,545 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-20 08:18:49,658 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:49,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:49,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:49,660 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:49,660 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:49,660 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:49,660 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:49,660 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:49,660 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration1_Lasso [2020-10-20 08:18:49,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:49,661 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:49,698 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-20 08:18:49,713 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-20 08:18:49,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-20 08:18:49,722 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-20 08:18:49,724 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-20 08:18:49,728 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-20 08:18:49,731 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-20 08:18:49,735 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-20 08:18:49,742 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-20 08:18:49,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-20 08:18:49,751 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-20 08:18:49,755 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-20 08:18:49,762 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-20 08:18:49,766 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-20 08:18:49,770 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-20 08:18:49,962 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-20 08:18:50,283 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:50,289 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-20 08:18:50,297 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-20 08:18:50,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:50,319 INFO L402 nArgumentSynthesizer]: A total of 2 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-20 08:18:50,328 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-20 08:18:50,375 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-20 08:18:50,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:50,383 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-20 08:18:50,436 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-20 08:18:50,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:50,443 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-20 08:18:50,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:50,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,492 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-20 08:18:50,494 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-20 08:18:50,539 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-20 08:18:50,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,543 INFO L402 nArgumentSynthesizer]: A total of 0 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-20 08:18:50,546 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-20 08:18:50,583 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-20 08:18:50,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,587 INFO L402 nArgumentSynthesizer]: A total of 0 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-20 08:18:50,590 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-20 08:18:50,624 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-20 08:18:50,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:50,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:50,635 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-20 08:18:50,671 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-20 08:18:50,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:50,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:50,684 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-20 08:18:50,718 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-20 08:18:50,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:50,722 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-20 08:18:50,745 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-20 08:18:50,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:50,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:50,757 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-20 08:18:50,799 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-20 08:18:50,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:50,805 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:50,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:50,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:50,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:50,855 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-20 08:18:50,884 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-20 08:18:50,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:50,894 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:50,916 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-20 08:18:50,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:50,921 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:50,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:50,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:50,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:50,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:50,952 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-20 08:18:50,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-20 08:18:50,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:50,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:50,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:50,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:50,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:50,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:50,994 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:51,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:51,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:51,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:51,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:51,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:51,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:51,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:51,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:51,038 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:51,065 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-20 08:18:51,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:51,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:51,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:51,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:51,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:51,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:51,077 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 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-20 08:18:51,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:51,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:51,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:51,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:51,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:51,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:51,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:51,127 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-20 08:18:51,179 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:51,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:51,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:51,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:51,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:51,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:51,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:51,188 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-20 08:18:51,231 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-20 08:18:51,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:51,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:51,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:51,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:51,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:51,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:51,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:51,303 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:18:51,303 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. 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-20 08:18:51,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:51,312 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:18:51,313 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:51,314 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-20 08:18:51,465 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-20 08:18:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:51,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:51,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:51,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:51,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:51,560 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-20 08:18:51,578 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-20 08:18:51,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-10-20 08:18:51,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2020-10-20 08:18:51,659 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-20 08:18:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-10-20 08:18:51,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-20 08:18:51,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:51,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-20 08:18:51,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:51,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 08:18:51,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:51,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2020-10-20 08:18:51,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:51,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2020-10-20 08:18:51,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:18:51,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:18:51,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-10-20 08:18:51,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:51,678 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 08:18:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-10-20 08:18:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-20 08:18:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:18:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-20 08:18:51,709 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 08:18:51,709 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 08:18:51,709 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:18:51,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-20 08:18:51,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:51,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:51,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:51,711 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:51,711 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:51,711 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 157#L528 assume !(main_~length1~0 < 1); 148#L528-2 assume !(main_~length2~0 < 1); 149#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 153#L537-3 assume !(main_~i~0 < main_~length1~0); 154#L537-4 main_~i~1 := 0; 155#L541-3 [2020-10-20 08:18:51,711 INFO L796 eck$LassoCheckResult]: Loop: 155#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 160#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 155#L541-3 [2020-10-20 08:18:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-20 08:18:51,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:51,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17066009] [2020-10-20 08:18:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:51,768 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-20 08:18:51,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17066009] [2020-10-20 08:18:51,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:51,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:51,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567564937] [2020-10-20 08:18:51,773 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-20 08:18:51,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:51,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172705470] [2020-10-20 08:18:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:51,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:51,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:51,796 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:51,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:51,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:51,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:51,864 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-20 08:18:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:51,917 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-10-20 08:18:51,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:51,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-10-20 08:18:51,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:51,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2020-10-20 08:18:51,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:18:51,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:18:51,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-10-20 08:18:51,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:51,922 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-20 08:18:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-10-20 08:18:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-20 08:18:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:18:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-10-20 08:18:51,929 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-20 08:18:51,929 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-20 08:18:51,929 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:18:51,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-10-20 08:18:51,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:51,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:51,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:51,933 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:51,933 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:51,934 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 198#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L528 assume !(main_~length1~0 < 1); 190#L528-2 assume !(main_~length2~0 < 1); 191#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 195#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 193#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 194#L537-3 assume !(main_~i~0 < main_~length1~0); 196#L537-4 main_~i~1 := 0; 197#L541-3 [2020-10-20 08:18:51,934 INFO L796 eck$LassoCheckResult]: Loop: 197#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 202#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 197#L541-3 [2020-10-20 08:18:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2020-10-20 08:18:51,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:51,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133253600] [2020-10-20 08:18:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:51,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:51,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:51,981 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2020-10-20 08:18:51,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:51,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372385978] [2020-10-20 08:18:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:51,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:52,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:52,012 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2020-10-20 08:18:52,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:52,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525570449] [2020-10-20 08:18:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:52,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:52,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:52,089 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:52,300 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-10-20 08:18:52,386 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:52,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:52,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:52,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:52,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:52,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:52,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:52,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:52,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration3_Lasso [2020-10-20 08:18:52,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:52,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:52,391 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-20 08:18:52,394 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-20 08:18:52,555 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-10-20 08:18:52,577 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-20 08:18:52,580 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-20 08:18:52,582 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-20 08:18:52,585 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-20 08:18:52,588 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-20 08:18:52,591 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-20 08:18:52,593 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-20 08:18:52,596 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-20 08:18:52,598 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-20 08:18:52,600 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-20 08:18:52,602 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-20 08:18:52,605 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-20 08:18:52,933 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:52,934 INFO L489 LassoAnalysis]: Using template 'affine'. 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-20 08:18:52,937 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-20 08:18:52,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:52,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:52,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:52,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:52,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:52,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:52,941 INFO L402 nArgumentSynthesizer]: A total of 0 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-20 08:18:52,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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:52,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-20 08:18:52,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:52,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:52,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:52,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:52,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:52,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:52,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:52,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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:53,024 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-20 08:18:53,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:53,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:53,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:53,029 INFO L402 nArgumentSynthesizer]: A total of 2 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-20 08:18:53,034 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) [2020-10-20 08:18:53,074 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-20 08:18:53,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:53,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:53,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:53,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:53,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:53,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:53,088 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) [2020-10-20 08:18:53,127 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-20 08:18:53,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:53,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:53,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:53,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:53,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:53,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:53,138 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) [2020-10-20 08:18:53,172 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-20 08:18:53,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:53,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:53,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:53,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:53,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:53,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:53,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:53,177 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:53,212 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-20 08:18:53,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:53,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:53,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:53,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:53,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:53,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:53,220 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:53,254 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-20 08:18:53,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:53,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:53,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:53,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:53,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:53,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:53,278 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:53,304 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 08:18:53,304 INFO L444 ModelExtractionUtils]: 13 out of 28 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:53,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:53,310 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:18:53,310 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:53,310 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~nondetString2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2020-10-20 08:18:53,362 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 08:18:53,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:18:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:53,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:53,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:53,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:53,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:53,411 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-20 08:18:53,412 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-20 08:18:53,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-20 08:18:53,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 6 states. [2020-10-20 08:18:53,458 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-20 08:18:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-20 08:18:53,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-20 08:18:53,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:53,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-20 08:18:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:53,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-20 08:18:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:53,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2020-10-20 08:18:53,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:53,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 24 transitions. [2020-10-20 08:18:53,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:18:53,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:53,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2020-10-20 08:18:53,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:53,463 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 08:18:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2020-10-20 08:18:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 08:18:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 08:18:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-10-20 08:18:53,466 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 08:18:53,466 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 08:18:53,466 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:18:53,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-10-20 08:18:53,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:53,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:53,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:53,468 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:53,468 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:53,468 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 324#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 325#L528 assume !(main_~length1~0 < 1); 316#L528-2 assume !(main_~length2~0 < 1); 317#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 321#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 319#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 320#L537-3 assume !(main_~i~0 < main_~length1~0); 322#L537-4 main_~i~1 := 0; 323#L541-3 assume !(main_~i~1 < main_~length2~0); 314#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 315#L519-4 [2020-10-20 08:18:53,468 INFO L796 eck$LassoCheckResult]: Loop: 315#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 318#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 312#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 315#L519-4 [2020-10-20 08:18:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-20 08:18:53,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:53,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259026962] [2020-10-20 08:18:53,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:53,502 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-20 08:18:53,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259026962] [2020-10-20 08:18:53,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:53,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:53,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405426817] [2020-10-20 08:18:53,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 1 times [2020-10-20 08:18:53,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:53,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398952904] [2020-10-20 08:18:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:53,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:53,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:53,525 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:53,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:53,625 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-20 08:18:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:53,646 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-10-20 08:18:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:53,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2020-10-20 08:18:53,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:53,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2020-10-20 08:18:53,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:18:53,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-10-20 08:18:53,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:53,649 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 08:18:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-10-20 08:18:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-20 08:18:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 08:18:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-10-20 08:18:53,652 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-20 08:18:53,652 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-20 08:18:53,652 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:18:53,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-10-20 08:18:53,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:53,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:53,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:53,654 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:53,654 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:53,654 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 368#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 369#L528 assume !(main_~length1~0 < 1); 360#L528-2 assume !(main_~length2~0 < 1); 361#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 365#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 363#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 364#L537-3 assume !(main_~i~0 < main_~length1~0); 366#L537-4 main_~i~1 := 0; 367#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 372#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 373#L541-3 assume !(main_~i~1 < main_~length2~0); 358#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 359#L519-4 [2020-10-20 08:18:53,654 INFO L796 eck$LassoCheckResult]: Loop: 359#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 362#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 356#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 357#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 359#L519-4 [2020-10-20 08:18:53,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-20 08:18:53,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:53,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194158779] [2020-10-20 08:18:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:53,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:53,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:53,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 2 times [2020-10-20 08:18:53,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:53,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551469203] [2020-10-20 08:18:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:53,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:53,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:53,707 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash -796589374, now seen corresponding path program 1 times [2020-10-20 08:18:53,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:53,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420828773] [2020-10-20 08:18:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:18:53,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420828773] [2020-10-20 08:18:53,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145169264] [2020-10-20 08:18:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:54,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-20 08:18:54,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:54,056 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-20 08:18:54,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:54,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:54,066 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:18:54,066 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-20 08:18:54,191 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-20 08:18:54,191 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:54,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:54,223 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-20 08:18:54,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:53, output treesize:37 [2020-10-20 08:18:54,392 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 08:18:54,394 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-10-20 08:18:54,397 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:54,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:54,413 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:18:54,413 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:47, output treesize:3 [2020-10-20 08:18:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:18:54,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:18:54,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-10-20 08:18:54,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158747094] [2020-10-20 08:18:54,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 08:18:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 08:18:54,510 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-10-20 08:18:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:54,803 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-10-20 08:18:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 08:18:54,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2020-10-20 08:18:54,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:54,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2020-10-20 08:18:54,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:18:54,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:54,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2020-10-20 08:18:54,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:54,805 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-10-20 08:18:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2020-10-20 08:18:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-20 08:18:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:18:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-10-20 08:18:54,808 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-20 08:18:54,808 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-20 08:18:54,808 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:18:54,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-10-20 08:18:54,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:54,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:54,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:54,810 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:54,810 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:54,811 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 490#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 491#L528 assume !(main_~length1~0 < 1); 481#L528-2 assume !(main_~length2~0 < 1); 482#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 486#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 484#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 485#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 487#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 496#L537-3 assume !(main_~i~0 < main_~length1~0); 488#L537-4 main_~i~1 := 0; 489#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 494#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 495#L541-3 assume !(main_~i~1 < main_~length2~0); 479#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 480#L519-4 [2020-10-20 08:18:54,811 INFO L796 eck$LassoCheckResult]: Loop: 480#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 483#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 477#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 478#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 480#L519-4 [2020-10-20 08:18:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 2 times [2020-10-20 08:18:54,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:54,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802399770] [2020-10-20 08:18:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:54,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:54,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:54,878 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 3 times [2020-10-20 08:18:54,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:54,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346032456] [2020-10-20 08:18:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:54,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:54,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:54,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1430636836, now seen corresponding path program 2 times [2020-10-20 08:18:54,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:54,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719214792] [2020-10-20 08:18:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:54,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:54,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:54,955 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:55,981 WARN L193 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2020-10-20 08:18:56,321 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-20 08:18:56,323 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:56,324 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:56,324 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:56,324 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:56,324 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:56,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:56,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:56,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:56,324 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration6_Lasso [2020-10-20 08:18:56,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:56,325 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:56,329 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-20 08:18:56,339 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-20 08:18:56,342 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-20 08:18:56,345 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-20 08:18:56,348 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-20 08:18:56,350 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-20 08:18:56,367 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-20 08:18:56,829 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2020-10-20 08:18:56,994 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2020-10-20 08:18:56,994 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-20 08:18:57,000 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-20 08:18:57,002 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-20 08:18:57,004 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-20 08:18:57,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-20 08:18:57,011 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-20 08:18:57,013 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-20 08:18:57,017 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-20 08:18:57,022 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-20 08:18:57,025 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-20 08:18:57,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-20 08:18:57,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-20 08:18:57,034 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-20 08:18:57,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-20 08:18:57,039 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-20 08:18:57,043 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-20 08:18:57,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-20 08:18:57,240 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-10-20 08:18:57,720 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:57,720 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:57,725 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-20 08:18:57,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:57,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:57,731 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-20 08:18:57,754 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-20 08:18:57,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:57,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:57,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:57,767 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-20 08:18:57,788 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-20 08:18:57,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:57,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:57,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:57,793 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-20 08:18:57,815 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-20 08:18:57,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:57,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:57,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:57,818 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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:57,842 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-20 08:18:57,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:57,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:57,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:57,845 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-20 08:18:57,869 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-20 08:18:57,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:57,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:57,875 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-20 08:18:57,896 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-20 08:18:57,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:57,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:57,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:57,901 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-20 08:18:57,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-20 08:18:57,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:57,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:57,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:57,927 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-20 08:18:57,949 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-20 08:18:57,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:57,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:57,959 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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:57,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:57,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:57,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:57,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:57,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:57,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:57,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:57,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 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-20 08:18:58,017 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-20 08:18:58,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:58,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:58,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:58,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:58,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:58,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:58,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:58,137 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-20 08:18:58,137 INFO L444 ModelExtractionUtils]: 16 out of 58 variables were initially zero. Simplification set additionally 39 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-20 08:18:58,141 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-20 08:18:58,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:18:58,144 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:58,144 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_3 Supporting invariants [] [2020-10-20 08:18:58,238 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2020-10-20 08:18:58,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:18:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:58,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:18:58,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:58,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 08:18:58,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:58,347 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-20 08:18:58,347 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-20 08:18:58,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 08:18:58,438 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 26 states and 32 transitions. Complement of second has 5 states. [2020-10-20 08:18:58,441 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-20 08:18:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 08:18:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-10-20 08:18:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-20 08:18:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 08:18:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2020-10-20 08:18:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:58,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-10-20 08:18:58,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:18:58,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 31 transitions. [2020-10-20 08:18:58,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:18:58,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:58,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2020-10-20 08:18:58,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:58,452 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-20 08:18:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2020-10-20 08:18:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-20 08:18:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 08:18:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-10-20 08:18:58,456 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-20 08:18:58,457 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-20 08:18:58,457 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:18:58,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-10-20 08:18:58,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:18:58,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:58,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:58,460 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:58,461 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:18:58,461 INFO L794 eck$LassoCheckResult]: Stem: 690#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 688#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 689#L528 assume !(main_~length1~0 < 1); 678#L528-2 assume !(main_~length2~0 < 1); 679#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 684#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 682#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 683#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 685#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 695#L537-3 assume !(main_~i~0 < main_~length1~0); 686#L537-4 main_~i~1 := 0; 687#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 693#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 694#L541-3 assume !(main_~i~1 < main_~length2~0); 676#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 677#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 680#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 672#L519-3 [2020-10-20 08:18:58,462 INFO L796 eck$LassoCheckResult]: Loop: 672#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 673#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 691#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 672#L519-3 [2020-10-20 08:18:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash -601862591, now seen corresponding path program 1 times [2020-10-20 08:18:58,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:58,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420410946] [2020-10-20 08:18:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:58,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:58,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:58,524 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 1 times [2020-10-20 08:18:58,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:58,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510439066] [2020-10-20 08:18:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:58,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:58,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:58,537 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1400069085, now seen corresponding path program 1 times [2020-10-20 08:18:58,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:58,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838630669] [2020-10-20 08:18:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:18:58,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838630669] [2020-10-20 08:18:58,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64950533] [2020-10-20 08:18:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:58,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-20 08:18:58,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:58,865 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-10-20 08:18:58,866 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-10-20 08:18:58,866 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:58,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:58,890 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-20 08:18:58,890 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:33 [2020-10-20 08:18:58,983 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 08:18:58,985 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:58,986 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2020-10-20 08:18:58,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:18:58,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:18:58,999 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:18:58,999 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2020-10-20 08:18:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:18:59,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:18:59,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-20 08:18:59,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748612307] [2020-10-20 08:18:59,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:59,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 08:18:59,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-10-20 08:18:59,040 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 16 states. [2020-10-20 08:18:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:59,520 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2020-10-20 08:18:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 08:18:59,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2020-10-20 08:18:59,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:18:59,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 30 states and 37 transitions. [2020-10-20 08:18:59,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:18:59,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:59,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-20 08:18:59,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:59,522 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-20 08:18:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-20 08:18:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2020-10-20 08:18:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 08:18:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-10-20 08:18:59,525 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-20 08:18:59,526 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-20 08:18:59,526 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:18:59,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-10-20 08:18:59,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:18:59,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:59,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:59,527 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:59,528 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:18:59,528 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 847#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 848#L528 assume !(main_~length1~0 < 1); 837#L528-2 assume !(main_~length2~0 < 1); 838#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 843#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 841#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 842#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 844#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 856#L537-3 assume !(main_~i~0 < main_~length1~0); 845#L537-4 main_~i~1 := 0; 846#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 852#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 853#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 854#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 855#L541-3 assume !(main_~i~1 < main_~length2~0); 835#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 836#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 839#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 831#L519-3 [2020-10-20 08:18:59,528 INFO L796 eck$LassoCheckResult]: Loop: 831#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 832#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 850#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 831#L519-3 [2020-10-20 08:18:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1483803875, now seen corresponding path program 2 times [2020-10-20 08:18:59,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:59,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259038626] [2020-10-20 08:18:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:59,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:59,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:59,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 2 times [2020-10-20 08:18:59,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:59,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227688179] [2020-10-20 08:18:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:59,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:59,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:59,563 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash 197886459, now seen corresponding path program 2 times [2020-10-20 08:18:59,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:59,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321875655] [2020-10-20 08:18:59,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:59,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:59,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:59,593 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:01,625 WARN L193 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 186 DAG size of output: 154 [2020-10-20 08:19:02,088 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-20 08:19:02,090 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:02,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:02,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:02,091 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:02,091 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:02,091 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:02,091 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:02,091 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:02,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration8_Lasso [2020-10-20 08:19:02,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:02,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:02,094 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-20 08:19:02,104 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-20 08:19:02,106 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-20 08:19:02,108 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-20 08:19:02,111 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-20 08:19:02,613 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2020-10-20 08:19:02,730 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-20 08:19:02,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-20 08:19:02,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-20 08:19:02,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-20 08:19:02,754 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-20 08:19:02,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-20 08:19:02,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-20 08:19:02,769 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-20 08:19:02,771 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-20 08:19:02,774 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-20 08:19:02,776 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-20 08:19:02,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-20 08:19:02,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-20 08:19:02,783 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-20 08:19:02,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-20 08:19:02,787 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-20 08:19:02,789 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-20 08:19:02,791 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-20 08:19:02,794 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-20 08:19:03,044 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-20 08:19:03,568 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:03,569 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 08:19:03,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:03,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:03,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:03,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:03,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:03,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:03,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:03,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:03,592 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-20 08:19:03,618 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-20 08:19:03,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:03,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:03,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:03,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:03,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:03,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:03,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:03,621 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-20 08:19:03,643 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-20 08:19:03,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:03,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:03,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:03,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:03,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:03,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:03,649 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-20 08:19:03,673 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-20 08:19:03,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:03,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:03,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:03,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:03,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:03,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:03,679 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-20 08:19:03,870 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-20 08:19:03,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:03,872 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 08:19:03,872 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-20 08:19:03,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:03,892 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2020-10-20 08:19:03,892 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-20 08:19:03,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 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-20 08:19:03,971 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-20 08:19:03,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:03,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:03,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:03,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:03,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:03,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:04,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:04,082 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2020-10-20 08:19:04,083 INFO L444 ModelExtractionUtils]: 22 out of 58 variables were initially zero. Simplification set additionally 33 variables to zero. 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-20 08:19:04,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:04,093 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:04,093 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:04,093 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_4 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2020-10-20 08:19:04,196 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2020-10-20 08:19:04,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:19:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:04,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:19:04,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:04,293 WARN L261 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 08:19:04,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:04,322 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-20 08:19:04,322 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-20 08:19:04,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 08:19:04,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 43 states and 52 transitions. Complement of second has 7 states. [2020-10-20 08:19:04,371 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-20 08:19:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:19:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-10-20 08:19:04,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 3 letters. [2020-10-20 08:19:04,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:04,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 22 letters. Loop has 3 letters. [2020-10-20 08:19:04,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:04,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2020-10-20 08:19:04,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:04,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2020-10-20 08:19:04,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:04,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 41 transitions. [2020-10-20 08:19:04,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:19:04,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 08:19:04,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2020-10-20 08:19:04,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:04,376 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-10-20 08:19:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2020-10-20 08:19:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-10-20 08:19:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 08:19:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-10-20 08:19:04,379 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-20 08:19:04,379 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-20 08:19:04,379 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:19:04,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-10-20 08:19:04,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:04,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:04,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:04,381 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:04,381 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:04,381 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1099#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1100#L528 assume !(main_~length1~0 < 1); 1088#L528-2 assume !(main_~length2~0 < 1); 1089#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1095#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1093#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1094#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1096#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1107#L537-3 assume !(main_~i~0 < main_~length1~0); 1097#L537-4 main_~i~1 := 0; 1098#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1104#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1105#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1106#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1108#L541-3 assume !(main_~i~1 < main_~length2~0); 1086#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1087#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1090#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1084#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1085#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1091#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1092#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1082#L519-3 [2020-10-20 08:19:04,382 INFO L796 eck$LassoCheckResult]: Loop: 1082#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1083#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1102#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1082#L519-3 [2020-10-20 08:19:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1839510475, now seen corresponding path program 3 times [2020-10-20 08:19:04,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:04,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814171404] [2020-10-20 08:19:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:19:04,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814171404] [2020-10-20 08:19:04,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237895874] [2020-10-20 08:19:04,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:19:04,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 08:19:04,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:19:04,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-20 08:19:04,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:04,727 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_129|], 1=[|v_#valid_152|]} [2020-10-20 08:19:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 08:19:04,730 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2020-10-20 08:19:04,730 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:04,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:04,743 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-20 08:19:04,745 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:04,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:04,753 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:19:04,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-10-20 08:19:04,853 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 42 treesize of output 25 [2020-10-20 08:19:04,854 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:04,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:04,872 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:04,873 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2020-10-20 08:19:04,993 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2020-10-20 08:19:04,996 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:05,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:05,015 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 08:19:05,016 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-10-20 08:19:05,017 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:05,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:05,028 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:19:05,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:3 [2020-10-20 08:19:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:19:05,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:19:05,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-10-20 08:19:05,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011450400] [2020-10-20 08:19:05,032 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 3 times [2020-10-20 08:19:05,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:05,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504205222] [2020-10-20 08:19:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:05,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:05,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:05,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:05,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:05,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 08:19:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-20 08:19:05,086 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 10 Second operand 16 states. [2020-10-20 08:19:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:05,719 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-10-20 08:19:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 08:19:05,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2020-10-20 08:19:05,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:05,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 30 states and 36 transitions. [2020-10-20 08:19:05,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:19:05,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 08:19:05,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2020-10-20 08:19:05,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:05,722 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-20 08:19:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2020-10-20 08:19:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-20 08:19:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 08:19:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-10-20 08:19:05,725 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-20 08:19:05,725 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-20 08:19:05,725 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:19:05,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-10-20 08:19:05,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:05,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:05,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:05,728 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:05,728 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:05,728 INFO L794 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1272#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1273#L528 assume !(main_~length1~0 < 1); 1260#L528-2 assume !(main_~length2~0 < 1); 1261#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1267#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1268#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1282#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1265#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1266#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1269#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1281#L537-3 assume !(main_~i~0 < main_~length1~0); 1270#L537-4 main_~i~1 := 0; 1271#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1279#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1280#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1277#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1278#L541-3 assume !(main_~i~1 < main_~length2~0); 1258#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1259#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1262#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1256#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1257#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1263#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1264#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1254#L519-3 [2020-10-20 08:19:05,728 INFO L796 eck$LassoCheckResult]: Loop: 1254#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1255#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1275#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1254#L519-3 [2020-10-20 08:19:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:05,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1269061459, now seen corresponding path program 4 times [2020-10-20 08:19:05,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:05,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105777255] [2020-10-20 08:19:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:05,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:05,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:05,760 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 4 times [2020-10-20 08:19:05,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:05,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766451531] [2020-10-20 08:19:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:05,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:05,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:05,767 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1987238385, now seen corresponding path program 1 times [2020-10-20 08:19:05,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:05,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017918088] [2020-10-20 08:19:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-20 08:19:05,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017918088] [2020-10-20 08:19:05,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618797898] [2020-10-20 08:19:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:19:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:05,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2020-10-20 08:19:05,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:05,906 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-10-20 08:19:05,907 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-10-20 08:19:05,908 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:05,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:05,915 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-20 08:19:05,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2020-10-20 08:19:18,167 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 08:19:18,168 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:18,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:18,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:19:18,170 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 08:19:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-20 08:19:18,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:19:18,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2020-10-20 08:19:18,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187517606] [2020-10-20 08:19:18,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 08:19:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2020-10-20 08:19:18,218 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 10 states. [2020-10-20 08:19:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:18,386 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-10-20 08:19:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:19:18,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2020-10-20 08:19:18,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:18,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 44 transitions. [2020-10-20 08:19:18,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:19:18,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:19:18,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2020-10-20 08:19:18,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:18,391 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2020-10-20 08:19:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2020-10-20 08:19:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-10-20 08:19:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:19:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-10-20 08:19:18,397 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-20 08:19:18,397 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-20 08:19:18,397 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:19:18,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-10-20 08:19:18,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:18,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:18,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:18,399 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:18,399 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:18,400 INFO L794 eck$LassoCheckResult]: Stem: 1452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1450#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1451#L528 assume !(main_~length1~0 < 1); 1439#L528-2 assume !(main_~length2~0 < 1); 1440#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1446#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1444#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1445#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1447#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1463#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1461#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1460#L537-3 assume !(main_~i~0 < main_~length1~0); 1448#L537-4 main_~i~1 := 0; 1449#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1456#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1457#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1458#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1459#L541-3 assume !(main_~i~1 < main_~length2~0); 1437#L541-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1438#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1441#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1435#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1436#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1454#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1455#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1462#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1442#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1443#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1433#L519-3 [2020-10-20 08:19:18,400 INFO L796 eck$LassoCheckResult]: Loop: 1433#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1434#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 1453#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1433#L519-3 [2020-10-20 08:19:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2062165185, now seen corresponding path program 2 times [2020-10-20 08:19:18,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509923929] [2020-10-20 08:19:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,432 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,433 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 5 times [2020-10-20 08:19:18,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571672436] [2020-10-20 08:19:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1249118883, now seen corresponding path program 3 times [2020-10-20 08:19:18,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411183286] [2020-10-20 08:19:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:22,712 WARN L193 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 271 DAG size of output: 223 [2020-10-20 08:19:23,588 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-10-20 08:19:23,591 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:23,591 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:23,591 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:23,591 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:23,591 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:23,591 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:23,592 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:23,592 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:23,592 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration11_Lasso [2020-10-20 08:19:23,592 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:23,592 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:23,597 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-20 08:19:23,599 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-20 08:19:23,601 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-20 08:19:23,603 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-20 08:19:23,607 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-20 08:19:23,609 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-20 08:19:23,613 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-20 08:19:23,618 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-20 08:19:23,622 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-20 08:19:23,624 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-20 08:19:23,626 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-20 08:19:23,629 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-20 08:19:23,632 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-20 08:19:23,635 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-20 08:19:23,637 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-20 08:19:23,640 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-20 08:19:23,643 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-20 08:19:23,654 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-20 08:19:23,657 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-20 08:19:24,440 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2020-10-20 08:19:24,587 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-10-20 08:19:24,588 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-20 08:19:24,595 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-20 08:19:24,597 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-20 08:19:24,599 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-20 08:19:24,894 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2020-10-20 08:19:25,263 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-20 08:19:25,828 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-10-20 08:19:25,903 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:25,903 INFO L489 LassoAnalysis]: Using template 'affine'. 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-20 08:19:25,908 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-20 08:19:25,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:25,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:25,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:25,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:25,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:25,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:25,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:25,912 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-20 08:19:25,937 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-20 08:19:25,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:25,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:25,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:25,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:25,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:25,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:25,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:25,941 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) [2020-10-20 08:19:25,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:25,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:25,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:25,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:25,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:25,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:25,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:25,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:25,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 58 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 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-20 08:19:25,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 [2020-10-20 08:19:25,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:25,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:25,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:25,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:25,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:25,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:25,997 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,021 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-20 08:19:26,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,024 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,046 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-20 08:19:26,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:26,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:26,051 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 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-20 08:19:26,074 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-20 08:19:26,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,077 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) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,099 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-20 08:19:26,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,102 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 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-20 08:19:26,126 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-20 08:19:26,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,129 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-20 08:19:26,152 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-20 08:19:26,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,154 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-20 08:19:26,176 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-20 08:19:26,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,179 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-20 08:19:26,201 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-20 08:19:26,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,205 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) [2020-10-20 08:19:26,239 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-20 08:19:26,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,244 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-20 08:19:26,265 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-20 08:19:26,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,268 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-20 08:19:26,290 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-20 08:19:26,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,293 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-20 08:19:26,316 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-20 08:19:26,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:26,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:26,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:26,319 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-20 08:19:26,340 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-20 08:19:26,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:26,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:26,345 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-20 08:19:26,368 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-20 08:19:26,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:26,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:26,374 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) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:26,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:26,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:26,407 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,433 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-20 08:19:26,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:26,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:26,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:26,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:26,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:26,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:26,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:26,516 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-10-20 08:19:26,517 INFO L444 ModelExtractionUtils]: 31 out of 61 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:26,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:19:26,521 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:26,521 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:26,521 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2020-10-20 08:19:26,674 INFO L297 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2020-10-20 08:19:26,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:19:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:26,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:26,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:26,750 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 08:19:26,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:26,773 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-20 08:19:26,774 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-20 08:19:26,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:19:26,808 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 42 states and 51 transitions. Complement of second has 5 states. [2020-10-20 08:19:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-10-20 08:19:26,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-20 08:19:26,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:26,810 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:19:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:26,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:26,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:26,893 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 08:19:26,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:26,915 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-20 08:19:26,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:19:26,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:19:26,957 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 52 transitions. Complement of second has 5 states. [2020-10-20 08:19:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2020-10-20 08:19:26,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-20 08:19:26,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:26,959 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:19:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:27,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:27,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:27,036 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 08:19:27,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:27,062 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-20 08:19:27,062 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:19:27,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:19:27,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 38 states and 45 transitions. Complement of second has 4 states. [2020-10-20 08:19:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-10-20 08:19:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-20 08:19:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 31 letters. Loop has 3 letters. [2020-10-20 08:19:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 28 letters. Loop has 6 letters. [2020-10-20 08:19:27,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:27,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2020-10-20 08:19:27,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:19:27,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2020-10-20 08:19:27,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:19:27,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:19:27,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:19:27,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:27,103 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:27,103 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:27,103 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:27,103 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:19:27,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:19:27,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:19:27,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:19:27,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:27 BoogieIcfgContainer [2020-10-20 08:19:27,111 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:27,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:27,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:27,112 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:27,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:48" (3/4) ... [2020-10-20 08:19:27,116 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:19:27,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:27,118 INFO L168 Benchmark]: Toolchain (without parser) took 39204.37 ms. Allocated memory was 42.5 MB in the beginning and 135.3 MB in the end (delta: 92.8 MB). Free memory was 23.6 MB in the beginning and 24.3 MB in the end (delta: -671.6 kB). Peak memory consumption was 92.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,119 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 32.0 MB. Free memory was 9.6 MB in the beginning and 9.5 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.99 ms. Allocated memory was 42.5 MB in the beginning and 45.1 MB in the end (delta: 2.6 MB). Free memory was 22.7 MB in the beginning and 14.2 MB in the end (delta: 8.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.31 ms. Allocated memory is still 45.1 MB. Free memory was 14.2 MB in the beginning and 12.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,120 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory was 45.1 MB in the beginning and 45.6 MB in the end (delta: 524.3 kB). Free memory was 12.1 MB in the beginning and 29.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,121 INFO L168 Benchmark]: RCFGBuilder took 390.90 ms. Allocated memory is still 45.6 MB. Free memory was 29.6 MB in the beginning and 11.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,121 INFO L168 Benchmark]: BuchiAutomizer took 38190.43 ms. Allocated memory was 45.6 MB in the beginning and 135.3 MB in the end (delta: 89.7 MB). Free memory was 11.5 MB in the beginning and 24.3 MB in the end (delta: -12.8 MB). Peak memory consumption was 76.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:27,121 INFO L168 Benchmark]: Witness Printer took 4.99 ms. Allocated memory is still 135.3 MB. Free memory is still 24.3 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:19:27,127 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.21 ms. Allocated memory is still 32.0 MB. Free memory was 9.6 MB in the beginning and 9.5 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 520.99 ms. Allocated memory was 42.5 MB in the beginning and 45.1 MB in the end (delta: 2.6 MB). Free memory was 22.7 MB in the beginning and 14.2 MB in the end (delta: 8.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.31 ms. Allocated memory is still 45.1 MB. Free memory was 14.2 MB in the beginning and 12.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 37.74 ms. Allocated memory was 45.1 MB in the beginning and 45.6 MB in the end (delta: 524.3 kB). Free memory was 12.1 MB in the beginning and 29.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 390.90 ms. Allocated memory is still 45.6 MB. Free memory was 29.6 MB in the beginning and 11.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 38190.43 ms. Allocated memory was 45.6 MB in the beginning and 135.3 MB in the end (delta: 89.7 MB). Free memory was 11.5 MB in the beginning and 24.3 MB in the end (delta: -12.8 MB). Peak memory consumption was 76.9 MB. Max. memory is 14.3 GB. * Witness Printer took 4.99 ms. Allocated memory is still 135.3 MB. Free memory is still 24.3 MB. There was no memory consumed. Max. memory is 14.3 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 - 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 unknown-#length-unknown[nondetString2] + -1 * i + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + 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 * scanp and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.1s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 35.1s. Construction of modules took 0.5s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 223 SDtfs, 326 SDslu, 554 SDs, 0 SdLazy, 545 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital317 mio100 ax107 hnf98 lsp89 ukn60 mio100 lsp52 div100 bol100 ite100 ukn100 eq183 hnf87 smp94 dnf140 smp93 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 249ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...