./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.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/reducercommutativity/max05-1.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 6ae365f36af85d643f41b38559013209b3bcedb0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:16:34,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:16:34,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:16:34,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:16:34,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:16:34,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:16:34,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:16:34,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:16:34,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:16:34,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:16:34,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:16:34,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:16:34,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:16:34,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:16:34,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:16:34,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:16:34,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:16:34,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:16:34,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:16:34,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:16:34,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:16:34,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:16:34,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:16:34,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:16:34,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:16:34,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:16:34,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:16:34,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:16:34,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:16:34,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:16:34,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:16:34,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:16:34,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:16:34,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:16:34,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:16:34,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:16:34,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:16:34,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:16:34,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:16:34,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:16:34,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:16:34,872 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:16:34,916 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:16:34,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:16:34,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:16:34,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:16:34,920 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:16:34,920 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:16:34,920 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:16:34,920 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:16:34,921 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:16:34,921 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:16:34,922 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:16:34,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:16:34,923 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:16:34,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:16:34,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:16:34,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:16:34,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:16:34,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:16:34,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:16:34,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:16:34,925 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:16:34,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:16:34,926 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:16:34,926 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:16:34,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:16:34,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:16:34,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:16:34,927 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:16:34,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:16:34,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:16:34,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:16:34,928 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:16:34,929 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:16:34,929 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 -> 6ae365f36af85d643f41b38559013209b3bcedb0 [2020-10-20 08:16:35,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:16:35,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:16:35,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:16:35,140 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:16:35,140 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:16:35,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2020-10-20 08:16:35,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62199e9ca/6870221e233b41f7a89d9856c524fdda/FLAGf31ce5b92 [2020-10-20 08:16:35,733 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:16:35,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2020-10-20 08:16:35,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62199e9ca/6870221e233b41f7a89d9856c524fdda/FLAGf31ce5b92 [2020-10-20 08:16:36,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62199e9ca/6870221e233b41f7a89d9856c524fdda [2020-10-20 08:16:36,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:16:36,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:16:36,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:36,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:16:36,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:16:36,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628fe787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36, skipping insertion in model container [2020-10-20 08:16:36,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:16:36,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:16:36,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:36,465 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:16:36,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:36,509 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:16:36,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36 WrapperNode [2020-10-20 08:16:36,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:36,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:36,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:16:36,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:16:36,521 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:16:36" (1/1) ... [2020-10-20 08:16:36,531 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:16:36" (1/1) ... [2020-10-20 08:16:36,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:36,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:16:36,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:16:36,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:16:36,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (1/1) ... [2020-10-20 08:16:36,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:16:36,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:16:36,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:16:36,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:16:36,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (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:16:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:16:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:16:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:16:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:16:36,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:16:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:16:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:16:37,148 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:16:37,149 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-20 08:16:37,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:37 BoogieIcfgContainer [2020-10-20 08:16:37,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:16:37,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:16:37,160 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:16:37,165 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:16:37,166 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:37,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:16:36" (1/3) ... [2020-10-20 08:16:37,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a5ebb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:37, skipping insertion in model container [2020-10-20 08:16:37,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:37,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:36" (2/3) ... [2020-10-20 08:16:37,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a5ebb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:37, skipping insertion in model container [2020-10-20 08:16:37,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:37,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:37" (3/3) ... [2020-10-20 08:16:37,172 INFO L373 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2020-10-20 08:16:37,222 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:16:37,222 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:16:37,222 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:16:37,222 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:16:37,223 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:16:37,223 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:16:37,223 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:16:37,223 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:16:37,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-20 08:16:37,260 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-20 08:16:37,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:37,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:37,267 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:16:37,268 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:37,268 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:16:37,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-20 08:16:37,271 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-20 08:16:37,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:37,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:37,272 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:16:37,272 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:37,279 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9#L34-3true [2020-10-20 08:16:37,279 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 12#L34-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 9#L34-3true [2020-10-20 08:16:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:16:37,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:37,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852399002] [2020-10-20 08:16:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:37,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:37,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:37,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 08:16:37,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:37,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026510167] [2020-10-20 08:16:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:37,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:37,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:37,459 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 08:16:37,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:37,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997670921] [2020-10-20 08:16:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:37,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:37,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:37,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:37,811 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-20 08:16:37,918 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:37,919 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:37,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:37,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:37,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:37,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:37,920 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:37,920 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:37,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2020-10-20 08:16:37,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:37,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:37,944 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:16:37,954 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:16:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:37,960 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:16:37,965 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:16:37,969 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:16:37,972 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:16:37,975 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:16:37,979 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:16:37,982 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:16:37,986 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:16:37,989 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:16:37,992 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:16:37,995 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:16:37,998 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:16:38,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:16:38,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:38,195 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:16:38,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:38,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:38,514 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:16:38,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:38,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:38,531 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:16:38,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:38,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:38,586 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:16:38,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:38,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:38,633 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:16:38,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:38,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:38,686 INFO L402 nArgumentSynthesizer]: A total of 2 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:16:38,691 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:16:38,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:38,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,752 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:16:38,754 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:16:38,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:16:38,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,802 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:16:38,804 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) [2020-10-20 08:16:38,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:38,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:38,856 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) [2020-10-20 08:16:38,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:38,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:38,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:38,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 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:16:38,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:16:38,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:38,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:38,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:38,950 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) [2020-10-20 08:16:38,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:38,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:38,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:38,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:38,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:38,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:38,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:38,992 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:16:39,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,046 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:16:39,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:16:39,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,079 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:16:39,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,108 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:16:39,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,136 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:16:39,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,170 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:16:39,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,202 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:16:39,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,241 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:16:39,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:39,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:39,271 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:16:39,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,311 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:39,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:39,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:39,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:39,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:39,468 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:16:39,472 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,511 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:39,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:39,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:39,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:39,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:39,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:39,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:39,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:39,747 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 08:16:39,747 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. 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:16:39,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:39,763 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:39,763 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:39,764 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-20 08:16:39,806 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 08:16:39,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:16:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:39,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:39,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:39,901 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:39,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:39,955 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:16:39,974 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:16:39,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-10-20 08:16:40,145 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 3 states. Result 87 states and 124 transitions. Complement of second has 8 states. [2020-10-20 08:16:40,146 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:16:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:16:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-10-20 08:16:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 08:16:40,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 08:16:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:40,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 08:16:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:40,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-10-20 08:16:40,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-10-20 08:16:40,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:16:40,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:40,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-20 08:16:40,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:40,190 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:16:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-20 08:16:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-20 08:16:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:16:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-20 08:16:40,228 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:16:40,229 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:16:40,229 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:16:40,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-10-20 08:16:40,231 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:40,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:40,232 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:16:40,232 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:40,232 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 204#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 205#L34-3 assume !(main_~i~1 < 5); 203#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 193#L20-3 [2020-10-20 08:16:40,233 INFO L796 eck$LassoCheckResult]: Loop: 193#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 194#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 198#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 193#L20-3 [2020-10-20 08:16:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 08:16:40,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735251562] [2020-10-20 08:16:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:40,310 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:16:40,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735251562] [2020-10-20 08:16:40,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:16:40,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:16:40,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233328582] [2020-10-20 08:16:40,314 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-10-20 08:16:40,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869868923] [2020-10-20 08:16:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:40,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:16:40,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:16:40,398 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:16:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:40,416 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-10-20 08:16:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:16:40,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-10-20 08:16:40,418 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-10-20 08:16:40,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:40,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:40,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-10-20 08:16:40,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:40,420 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-20 08:16:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-10-20 08:16:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-20 08:16:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:16:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-20 08:16:40,423 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-20 08:16:40,424 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-20 08:16:40,424 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:16:40,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-10-20 08:16:40,425 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:40,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:40,426 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:16:40,426 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:40,426 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 261#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 262#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 263#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 264#L34-3 assume !(main_~i~1 < 5); 260#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 250#L20-3 [2020-10-20 08:16:40,426 INFO L796 eck$LassoCheckResult]: Loop: 250#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 251#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 259#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 254#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 250#L20-3 [2020-10-20 08:16:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-20 08:16:40,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963280971] [2020-10-20 08:16:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:40,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963280971] [2020-10-20 08:16:40,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691627254] [2020-10-20 08:16:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:40,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 08:16:40,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:40,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:40,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 08:16:40,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366968717] [2020-10-20 08:16:40,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-10-20 08:16:40,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163925313] [2020-10-20 08:16:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,533 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:40,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:16:40,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:16:40,590 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 08:16:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:40,610 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-20 08:16:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:16:40,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-20 08:16:40,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-10-20 08:16:40,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:40,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:40,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-10-20 08:16:40,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:40,614 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-20 08:16:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-10-20 08:16:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-20 08:16:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 08:16:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 08:16:40,617 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 08:16:40,618 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 08:16:40,618 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:16:40,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-10-20 08:16:40,619 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:40,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:40,620 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 08:16:40,620 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:40,620 INFO L794 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 337#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 338#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 339#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 340#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 341#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 346#L34-3 assume !(main_~i~1 < 5); 336#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 326#L20-3 [2020-10-20 08:16:40,620 INFO L796 eck$LassoCheckResult]: Loop: 326#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 327#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 335#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 330#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 326#L20-3 [2020-10-20 08:16:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-20 08:16:40,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143891508] [2020-10-20 08:16:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:40,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143891508] [2020-10-20 08:16:40,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828136978] [2020-10-20 08:16:40,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:40,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:40,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:40,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:40,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:40,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 08:16:40,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393382762] [2020-10-20 08:16:40,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-10-20 08:16:40,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939074331] [2020-10-20 08:16:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:40,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:40,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:16:40,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:16:40,792 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-20 08:16:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:40,811 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-10-20 08:16:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:16:40,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-10-20 08:16:40,813 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-10-20 08:16:40,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:40,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:40,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-20 08:16:40,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:40,814 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-20 08:16:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-20 08:16:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-20 08:16:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 08:16:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-20 08:16:40,817 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-20 08:16:40,817 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-20 08:16:40,818 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:16:40,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-10-20 08:16:40,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:40,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:40,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:40,819 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-20 08:16:40,820 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:40,820 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 428#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 424#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 425#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 426#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 427#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 429#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 435#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 434#L34-3 assume !(main_~i~1 < 5); 423#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 413#L20-3 [2020-10-20 08:16:40,820 INFO L796 eck$LassoCheckResult]: Loop: 413#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 414#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 422#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 417#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 413#L20-3 [2020-10-20 08:16:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-20 08:16:40,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196350991] [2020-10-20 08:16:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:40,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196350991] [2020-10-20 08:16:40,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123620218] [2020-10-20 08:16:40,864 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:40,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 08:16:40,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:40,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:16:40,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:40,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:40,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 08:16:40,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078175281] [2020-10-20 08:16:40,943 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-10-20 08:16:40,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:40,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833698653] [2020-10-20 08:16:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:40,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:40,955 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:41,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:16:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:16:41,004 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-20 08:16:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:41,032 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-10-20 08:16:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:16:41,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-10-20 08:16:41,034 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:41,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-10-20 08:16:41,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:41,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:41,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-20 08:16:41,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:41,035 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-20 08:16:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-20 08:16:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-20 08:16:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:16:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-10-20 08:16:41,041 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-20 08:16:41,042 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-20 08:16:41,042 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:16:41,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-10-20 08:16:41,043 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:41,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:41,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:41,044 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-20 08:16:41,044 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:41,044 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 522#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 523#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 524#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 525#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 526#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 528#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 535#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 534#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 533#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 532#L34-3 assume !(main_~i~1 < 5); 521#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 511#L20-3 [2020-10-20 08:16:41,045 INFO L796 eck$LassoCheckResult]: Loop: 511#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 512#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 520#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 515#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 511#L20-3 [2020-10-20 08:16:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-20 08:16:41,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:41,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550589146] [2020-10-20 08:16:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:41,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550589146] [2020-10-20 08:16:41,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401992126] [2020-10-20 08:16:41,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:41,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:16:41,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:41,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:41,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:41,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:41,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 08:16:41,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503253217] [2020-10-20 08:16:41,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-10-20 08:16:41,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:41,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974715493] [2020-10-20 08:16:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:41,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:16:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:16:41,336 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-20 08:16:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:41,369 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-10-20 08:16:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:16:41,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-10-20 08:16:41,372 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:41,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2020-10-20 08:16:41,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:41,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:41,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2020-10-20 08:16:41,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:41,374 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-20 08:16:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2020-10-20 08:16:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-20 08:16:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-20 08:16:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-20 08:16:41,377 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-20 08:16:41,377 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-20 08:16:41,377 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:16:41,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-20 08:16:41,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:41,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:41,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:41,380 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-20 08:16:41,380 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:41,380 INFO L794 eck$LassoCheckResult]: Stem: 635#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 630#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 631#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 632#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 633#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 634#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 645#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 644#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 643#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 642#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 641#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 640#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 639#L34-3 assume !(main_~i~1 < 5); 629#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 619#L20-3 [2020-10-20 08:16:41,380 INFO L796 eck$LassoCheckResult]: Loop: 619#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 620#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 628#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 623#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 619#L20-3 [2020-10-20 08:16:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-20 08:16:41,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:41,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335020596] [2020-10-20 08:16:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-10-20 08:16:41,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:41,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119122963] [2020-10-20 08:16:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2020-10-20 08:16:41,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:41,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822631678] [2020-10-20 08:16:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:41,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:41,536 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:42,692 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2020-10-20 08:16:42,878 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-20 08:16:42,880 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:42,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:42,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:42,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:42,880 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:42,880 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:42,880 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:42,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:42,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2020-10-20 08:16:42,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:42,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:42,886 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:16:42,891 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:16:42,893 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:16:42,896 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:16:42,899 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:16:42,901 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:16:42,904 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:16:42,907 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:16:42,911 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:16:42,915 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:16:42,917 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:16:42,921 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:16:42,925 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:16:42,932 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:16:42,934 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:16:42,936 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:16:42,938 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:16:42,941 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:16:42,944 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:16:42,948 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:16:42,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:43,197 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-20 08:16:43,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:43,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:43,238 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:16:43,240 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:16:43,623 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:43,624 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:43,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,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 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:16:43,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,664 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:16:43,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:43,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:43,693 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:16:43,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:16:43,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:43,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:43,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:43,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:43,787 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:16:43,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,817 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:16:43,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,843 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:16:43,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:43,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:43,874 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:16:43,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:16:43,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,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 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:16:43,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:43,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:43,933 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:16:43,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:43,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,961 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:43,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:43,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:43,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:43,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:43,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:43,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:43,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:43,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:43,992 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:44,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:44,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,044 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:16:44,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:44,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,071 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) [2020-10-20 08:16:44,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,097 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:16:44,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,124 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:16:44,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,151 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:16:44,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:16:44,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,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:16:44,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:44,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:44,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:44,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,337 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:16:44,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:44,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,440 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:16:44,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:44,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:44,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:44,468 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:16:44,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,508 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:16:44,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:16:44,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,550 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:16:44,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,579 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:16:44,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:44,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:44,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:44,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:44,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:44,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:44,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:44,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:44,638 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 08:16:44,638 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. 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:16:44,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:44,642 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:44,642 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:44,642 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2020-10-20 08:16:44,702 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 08:16:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:44,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:44,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:44,760 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:16:44,760 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:16:44,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 08:16:44,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2020-10-20 08:16:44,792 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:16:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:16:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-20 08:16:44,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-20 08:16:44,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:44,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2020-10-20 08:16:44,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:44,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2020-10-20 08:16:44,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:44,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2020-10-20 08:16:44,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:44,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2020-10-20 08:16:44,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 08:16:44,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 08:16:44,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-10-20 08:16:44,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:44,798 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-20 08:16:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-10-20 08:16:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-20 08:16:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 08:16:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-10-20 08:16:44,800 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-20 08:16:44,800 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-20 08:16:44,801 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:16:44,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-10-20 08:16:44,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:44,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:44,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:44,802 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:44,802 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:44,802 INFO L794 eck$LassoCheckResult]: Stem: 830#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 829#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 825#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 826#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 827#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 828#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 840#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 839#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 838#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 837#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 836#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 835#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 834#L34-3 assume !(main_~i~1 < 5); 824#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 813#L20-3 assume !(max_~i~0 < 5); 809#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 810#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 833#L20-8 [2020-10-20 08:16:44,803 INFO L796 eck$LassoCheckResult]: Loop: 833#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 819#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 811#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 812#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 833#L20-8 [2020-10-20 08:16:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2020-10-20 08:16:44,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133680525] [2020-10-20 08:16:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 08:16:44,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133680525] [2020-10-20 08:16:44,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:16:44,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:16:44,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740536779] [2020-10-20 08:16:44,842 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:44,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-10-20 08:16:44,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000825890] [2020-10-20 08:16:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:44,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:16:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:16:44,887 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:16:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:44,930 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-10-20 08:16:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:16:44,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2020-10-20 08:16:44,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:44,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2020-10-20 08:16:44,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 08:16:44,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 08:16:44,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-10-20 08:16:44,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:44,934 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-10-20 08:16:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-10-20 08:16:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2020-10-20 08:16:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 08:16:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-20 08:16:44,937 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-20 08:16:44,937 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-20 08:16:44,937 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:16:44,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-20 08:16:44,938 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:44,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:44,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:44,939 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:44,939 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:44,939 INFO L794 eck$LassoCheckResult]: Stem: 915#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 910#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 911#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 912#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 913#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 914#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 926#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 925#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 924#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 923#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 922#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 921#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 920#L34-3 assume !(main_~i~1 < 5); 909#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 898#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 899#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 908#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 903#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 900#L20-3 assume !(max_~i~0 < 5); 894#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 895#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 918#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 904#L21-3 [2020-10-20 08:16:44,939 INFO L796 eck$LassoCheckResult]: Loop: 904#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 896#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 897#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 919#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 904#L21-3 [2020-10-20 08:16:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2020-10-20 08:16:44,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095086012] [2020-10-20 08:16:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 08:16:44,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095086012] [2020-10-20 08:16:44,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014070582] [2020-10-20 08:16:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:45,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 08:16:45,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 08:16:45,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:45,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 08:16:45,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345494284] [2020-10-20 08:16:45,040 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-10-20 08:16:45,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145468151] [2020-10-20 08:16:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,052 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:45,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:16:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:16:45,124 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 08:16:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:45,208 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2020-10-20 08:16:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:16:45,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2020-10-20 08:16:45,209 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:45,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2020-10-20 08:16:45,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-20 08:16:45,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-20 08:16:45,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2020-10-20 08:16:45,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:45,211 INFO L691 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2020-10-20 08:16:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2020-10-20 08:16:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2020-10-20 08:16:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 08:16:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-10-20 08:16:45,214 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-10-20 08:16:45,214 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-10-20 08:16:45,214 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:16:45,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2020-10-20 08:16:45,215 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:45,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:45,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:45,216 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:45,216 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:45,216 INFO L794 eck$LassoCheckResult]: Stem: 1080#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1075#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1076#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1077#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1078#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1079#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1097#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1096#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1095#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1093#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1091#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1090#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1089#L34-3 assume !(main_~i~1 < 5); 1074#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1061#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1062#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1088#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1087#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1063#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1064#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1073#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1067#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1068#L20-3 assume !(max_~i~0 < 5); 1059#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1060#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1084#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1094#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1092#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1085#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1083#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1069#L21-3 [2020-10-20 08:16:45,217 INFO L796 eck$LassoCheckResult]: Loop: 1069#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1057#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1058#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1086#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1069#L21-3 [2020-10-20 08:16:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2020-10-20 08:16:45,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493178765] [2020-10-20 08:16:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 08:16:45,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493178765] [2020-10-20 08:16:45,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131817609] [2020-10-20 08:16:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:45,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:45,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 08:16:45,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:45,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 08:16:45,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383500670] [2020-10-20 08:16:45,346 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-10-20 08:16:45,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869607796] [2020-10-20 08:16:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,354 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:45,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:16:45,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:16:45,425 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-20 08:16:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:45,526 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2020-10-20 08:16:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:16:45,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2020-10-20 08:16:45,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:45,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2020-10-20 08:16:45,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-20 08:16:45,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 08:16:45,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2020-10-20 08:16:45,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:45,529 INFO L691 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2020-10-20 08:16:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2020-10-20 08:16:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2020-10-20 08:16:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-20 08:16:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2020-10-20 08:16:45,533 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-10-20 08:16:45,533 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-10-20 08:16:45,533 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:16:45,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2020-10-20 08:16:45,534 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:45,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:45,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:45,535 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:45,535 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:45,535 INFO L794 eck$LassoCheckResult]: Stem: 1290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1285#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1286#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1287#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1288#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1289#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1306#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1305#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1304#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1303#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1302#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1301#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1300#L34-3 assume !(main_~i~1 < 5); 1284#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1269#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1270#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1307#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1275#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1276#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1308#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1310#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1309#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1271#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1272#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1282#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1283#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1296#L20-3 assume !(max_~i~0 < 5); 1265#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1266#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1293#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1277#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1278#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1294#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1295#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1313#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1267#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1268#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1312#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1298#L21-3 [2020-10-20 08:16:45,535 INFO L796 eck$LassoCheckResult]: Loop: 1298#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1311#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1299#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1297#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1298#L21-3 [2020-10-20 08:16:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,536 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2020-10-20 08:16:45,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588868523] [2020-10-20 08:16:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-20 08:16:45,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588868523] [2020-10-20 08:16:45,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088376202] [2020-10-20 08:16:45,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:45,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:45,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:45,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:16:45,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-20 08:16:45,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:45,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 08:16:45,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3751263] [2020-10-20 08:16:45,681 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-10-20 08:16:45,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142373614] [2020-10-20 08:16:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:45,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:16:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:16:45,763 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-20 08:16:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:45,894 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-10-20 08:16:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:16:45,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2020-10-20 08:16:45,896 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:45,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2020-10-20 08:16:45,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-20 08:16:45,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-20 08:16:45,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2020-10-20 08:16:45,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:45,898 INFO L691 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2020-10-20 08:16:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2020-10-20 08:16:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2020-10-20 08:16:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 08:16:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-10-20 08:16:45,913 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-10-20 08:16:45,913 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-10-20 08:16:45,913 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:16:45,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2020-10-20 08:16:45,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:45,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:45,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:45,917 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:45,918 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:45,919 INFO L794 eck$LassoCheckResult]: Stem: 1543#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1538#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1539#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1540#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1541#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1542#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1544#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1561#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1560#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1559#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1558#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1556#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1555#L34-3 assume !(main_~i~1 < 5); 1537#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1522#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1523#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1535#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1536#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1524#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1525#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1574#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1528#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1529#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1573#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1572#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1571#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1570#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1551#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1563#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1557#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1550#L20-3 assume !(max_~i~0 < 5); 1518#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1519#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1547#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1530#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1531#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1548#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1549#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1569#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1520#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1521#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1568#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1567#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1566#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1565#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1564#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1553#L21-3 [2020-10-20 08:16:45,919 INFO L796 eck$LassoCheckResult]: Loop: 1553#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1562#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1554#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1552#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1553#L21-3 [2020-10-20 08:16:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2020-10-20 08:16:45,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811340640] [2020-10-20 08:16:45,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 08:16:46,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811340640] [2020-10-20 08:16:46,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158567421] [2020-10-20 08:16:46,005 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:46,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 08:16:46,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:46,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:46,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 08:16:46,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:46,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 08:16:46,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240197404] [2020-10-20 08:16:46,121 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:46,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-10-20 08:16:46,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393670758] [2020-10-20 08:16:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:16:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:16:46,205 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-10-20 08:16:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:46,329 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-10-20 08:16:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:16:46,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2020-10-20 08:16:46,332 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:46,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2020-10-20 08:16:46,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-10-20 08:16:46,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-10-20 08:16:46,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2020-10-20 08:16:46,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:46,334 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2020-10-20 08:16:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2020-10-20 08:16:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2020-10-20 08:16:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 08:16:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2020-10-20 08:16:46,338 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-10-20 08:16:46,338 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-10-20 08:16:46,338 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:16:46,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2020-10-20 08:16:46,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:46,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:46,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:46,340 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:46,340 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:46,340 INFO L794 eck$LassoCheckResult]: Stem: 1831#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1825#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1826#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1827#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1828#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1829#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1854#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1852#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1850#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1848#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1846#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1844#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1843#L34-3 assume !(main_~i~1 < 5); 1824#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1811#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1812#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1830#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1871#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1813#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1814#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1823#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1817#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1818#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1870#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1869#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1868#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1867#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1866#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1865#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1864#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1863#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1838#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1861#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1859#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1837#L20-3 assume !(max_~i~0 < 5); 1807#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1808#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1835#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1862#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1860#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1836#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1834#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1819#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1809#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1810#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1858#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1857#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1856#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1855#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1853#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1851#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1849#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1847#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1845#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1840#L21-3 [2020-10-20 08:16:46,340 INFO L796 eck$LassoCheckResult]: Loop: 1840#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1842#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1841#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1839#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1840#L21-3 [2020-10-20 08:16:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2020-10-20 08:16:46,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425481695] [2020-10-20 08:16:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,420 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-10-20 08:16:46,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98876890] [2020-10-20 08:16:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,427 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,428 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2020-10-20 08:16:46,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318621894] [2020-10-20 08:16:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-20 08:16:46,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318621894] [2020-10-20 08:16:46,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776576910] [2020-10-20 08:16:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:46,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:16:46,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-20 08:16:46,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 08:16:46,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2020-10-20 08:16:46,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890222214] [2020-10-20 08:16:46,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:16:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:16:46,702 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 8 states. [2020-10-20 08:16:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:46,826 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2020-10-20 08:16:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 08:16:46,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2020-10-20 08:16:46,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:16:46,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2020-10-20 08:16:46,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-20 08:16:46,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-20 08:16:46,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2020-10-20 08:16:46,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:46,830 INFO L691 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-20 08:16:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2020-10-20 08:16:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-20 08:16:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 08:16:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2020-10-20 08:16:46,839 INFO L714 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-20 08:16:46,839 INFO L594 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-20 08:16:46,839 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:16:46,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2020-10-20 08:16:46,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:16:46,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:46,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:46,844 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:46,844 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:46,845 INFO L794 eck$LassoCheckResult]: Stem: 2159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2154#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2155#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2156#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2157#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2158#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2179#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2176#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2173#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2170#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2168#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2166#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2165#L34-3 assume !(main_~i~1 < 5); 2153#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2145#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2146#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2152#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2147#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2148#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2202#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2201#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2200#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2198#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2196#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2194#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2192#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2190#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2188#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2186#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2183#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2181#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2178#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2175#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2172#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2164#L20-3 assume !(max_~i~0 < 5); 2141#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2142#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2162#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2149#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2143#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2144#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2163#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2199#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2197#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2195#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2193#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2191#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2189#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2187#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2185#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2184#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2182#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2180#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2177#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2174#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2171#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2169#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2167#L20-8 assume !(max_~i~0 < 5); 2160#L20-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2161#L23-1 main_#t~ret12 := max_#res;main_~ret2~0 := main_#t~ret12;havoc main_#t~ret12;call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem13;havoc main_#t~mem13;main_~i~2 := 0; 2150#L43-3 [2020-10-20 08:16:46,845 INFO L796 eck$LassoCheckResult]: Loop: 2150#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem15 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem15, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem15; 2151#L43-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 2150#L43-3 [2020-10-20 08:16:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2020-10-20 08:16:46,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514049128] [2020-10-20 08:16:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,916 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-10-20 08:16:46,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463852513] [2020-10-20 08:16:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2020-10-20 08:16:46,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939211045] [2020-10-20 08:16:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:47,009 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:52,072 WARN L193 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 433 DAG size of output: 314 [2020-10-20 08:16:53,070 WARN L193 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 140 [2020-10-20 08:16:53,073 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:53,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:53,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:53,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:53,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:53,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:53,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:53,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:53,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration14_Lasso [2020-10-20 08:16:53,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:53,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:53,082 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:16:53,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:16:53,097 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:16:53,101 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:16:53,103 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:16:53,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:16:53,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:16:53,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:16:53,115 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:16:53,696 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-10-20 08:16:53,795 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:16:53,799 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:16:53,812 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:16:53,815 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:16:53,818 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:16:53,821 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:16:53,823 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:16:53,827 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:16:53,830 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:16:53,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:53,835 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:16:53,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:53,843 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:16:53,847 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:16:54,376 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:54,376 INFO L489 LassoAnalysis]: Using template 'affine'. 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:16:54,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:54,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:54,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:54,386 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:16:54,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:54,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:54,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:54,410 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:16:54,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:54,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:54,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:54,435 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:16:54,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:54,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:54,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:54,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:54,467 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:16:54,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:54,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:54,500 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 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:16:54,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:54,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:54,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:54,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:54,525 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:54,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:54,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:54,554 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:54,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:54,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:54,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:54,588 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:54,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:54,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:54,618 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:54,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:16:54,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:54,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:54,656 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:54,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:54,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:54,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:54,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:54,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:54,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:54,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:54,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:54,742 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 08:16:54,742 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:54,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:54,746 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:54,747 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:54,747 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2020-10-20 08:16:54,899 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2020-10-20 08:16:54,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:16:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:54,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:54,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:54,980 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:54,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:55,015 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:16:55,015 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:16:55,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:16:55,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2020-10-20 08:16:55,026 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:16:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:16:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-10-20 08:16:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2020-10-20 08:16:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2020-10-20 08:16:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2020-10-20 08:16:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:55,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2020-10-20 08:16:55,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:16:55,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2020-10-20 08:16:55,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:16:55,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:16:55,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:16:55,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:55,031 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:16:55,031 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:16:55,031 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:16:55,031 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:16:55,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:16:55,031 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:16:55,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:16:55,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:16:55 BoogieIcfgContainer [2020-10-20 08:16:55,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:16:55,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:16:55,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:16:55,039 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:16:55,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:37" (3/4) ... [2020-10-20 08:16:55,043 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:16:55,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:16:55,044 INFO L168 Benchmark]: Toolchain (without parser) took 18930.91 ms. Allocated memory was 39.3 MB in the beginning and 113.2 MB in the end (delta: 73.9 MB). Free memory was 17.5 MB in the beginning and 81.9 MB in the end (delta: -64.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,045 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 30.9 MB. Free memory was 6.8 MB in the beginning and 6.7 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.81 ms. Allocated memory was 39.3 MB in the beginning and 40.4 MB in the end (delta: 1.0 MB). Free memory was 16.7 MB in the beginning and 16.9 MB in the end (delta: -236.2 kB). Peak memory consumption was 8.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 40.4 MB. Free memory was 16.7 MB in the beginning and 14.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,046 INFO L168 Benchmark]: Boogie Preprocessor took 31.02 ms. Allocated memory is still 40.4 MB. Free memory was 14.7 MB in the beginning and 13.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,046 INFO L168 Benchmark]: RCFGBuilder took 560.86 ms. Allocated memory was 40.4 MB in the beginning and 43.0 MB in the end (delta: 2.6 MB). Free memory was 13.0 MB in the beginning and 9.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,047 INFO L168 Benchmark]: BuchiAutomizer took 17878.26 ms. Allocated memory was 43.0 MB in the beginning and 113.2 MB in the end (delta: 70.3 MB). Free memory was 26.4 MB in the beginning and 83.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,047 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 113.2 MB. Free memory was 83.4 MB in the beginning and 81.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:16:55,049 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.30 ms. Allocated memory is still 30.9 MB. Free memory was 6.8 MB in the beginning and 6.7 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 389.81 ms. Allocated memory was 39.3 MB in the beginning and 40.4 MB in the end (delta: 1.0 MB). Free memory was 16.7 MB in the beginning and 16.9 MB in the end (delta: -236.2 kB). Peak memory consumption was 8.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 40.4 MB. Free memory was 16.7 MB in the beginning and 14.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.02 ms. Allocated memory is still 40.4 MB. Free memory was 14.7 MB in the beginning and 13.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 560.86 ms. Allocated memory was 40.4 MB in the beginning and 43.0 MB in the end (delta: 2.6 MB). Free memory was 13.0 MB in the beginning and 9.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 17878.26 ms. Allocated memory was 43.0 MB in the beginning and 113.2 MB in the end (delta: 70.3 MB). Free memory was 26.4 MB in the beginning and 83.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 14.3 GB. * Witness Printer took 4.63 ms. Allocated memory is still 113.2 MB. Free memory was 83.4 MB in the beginning and 81.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 16.2s. Construction of modules took 0.6s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 353 SDtfs, 376 SDslu, 690 SDs, 0 SdLazy, 415 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital263 mio100 ax100 hnf99 lsp95 ukn53 mio100 lsp45 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...