./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.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/rangesum.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 a9e9e68a4ced07da63a78ebad1c2cc86cbb57dae ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:16:43,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:16:43,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:16:43,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:16:43,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:16:44,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:16:44,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:16:44,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:16:44,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:16:44,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:16:44,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:16:44,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:16:44,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:16:44,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:16:44,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:16:44,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:16:44,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:16:44,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:16:44,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:16:44,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:16:44,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:16:44,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:16:44,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:16:44,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:16:44,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:16:44,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:16:44,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:16:44,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:16:44,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:16:44,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:16:44,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:16:44,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:16:44,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:16:44,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:16:44,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:16:44,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:16:44,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:16:44,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:16:44,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:16:44,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:16:44,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:16:44,074 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:44,136 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:16:44,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:16:44,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:16:44,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:16:44,140 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:16:44,140 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:16:44,141 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:16:44,141 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:16:44,141 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:16:44,141 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:16:44,142 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:16:44,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:16:44,143 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:16:44,144 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:16:44,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:16:44,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:16:44,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:16:44,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:16:44,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:16:44,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:16:44,145 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:16:44,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:16:44,146 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:16:44,146 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:16:44,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:16:44,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:16:44,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:16:44,147 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:16:44,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:16:44,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:16:44,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:16:44,148 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:16:44,150 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:16:44,150 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 -> a9e9e68a4ced07da63a78ebad1c2cc86cbb57dae [2020-10-20 08:16:44,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:16:44,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:16:44,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:16:44,421 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:16:44,421 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:16:44,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2020-10-20 08:16:44,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445bd94b9/89cf9fc460394c8798bda1a8071dcac0/FLAG2e902d8df [2020-10-20 08:16:44,964 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:16:44,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2020-10-20 08:16:44,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445bd94b9/89cf9fc460394c8798bda1a8071dcac0/FLAG2e902d8df [2020-10-20 08:16:45,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445bd94b9/89cf9fc460394c8798bda1a8071dcac0 [2020-10-20 08:16:45,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:16:45,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:16:45,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:45,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:16:45,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:16:45,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:45" (1/1) ... [2020-10-20 08:16:45,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1175a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:45, skipping insertion in model container [2020-10-20 08:16:45,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:45" (1/1) ... [2020-10-20 08:16:45,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:16:45,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:16:45,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:45,660 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:16:45,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:45,707 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:16:45,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:45 WrapperNode [2020-10-20 08:16:45,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:45,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:45,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:16:45,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:16:45,718 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:45" (1/1) ... [2020-10-20 08:16:45,729 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:45" (1/1) ... [2020-10-20 08:16:45,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:45,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:16:45,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:16:45,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:16:45,775 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:45" (1/1) ... [2020-10-20 08:16:45,776 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:45" (1/1) ... [2020-10-20 08:16:45,779 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:45" (1/1) ... [2020-10-20 08:16:45,780 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:45" (1/1) ... [2020-10-20 08:16:45,789 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:45" (1/1) ... [2020-10-20 08:16:45,795 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:45" (1/1) ... [2020-10-20 08:16:45,797 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:45" (1/1) ... [2020-10-20 08:16:45,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:16:45,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:16:45,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:16:45,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:16:45,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:45" (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:45,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:16:45,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:16:45,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:16:45,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:16:45,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:16:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:16:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:16:46,254 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:16:46,254 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-20 08:16:46,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:46 BoogieIcfgContainer [2020-10-20 08:16:46,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:16:46,258 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:16:46,258 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:16:46,263 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:16:46,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:46,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:16:45" (1/3) ... [2020-10-20 08:16:46,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64d4ba08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:46, skipping insertion in model container [2020-10-20 08:16:46,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:46,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:45" (2/3) ... [2020-10-20 08:16:46,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64d4ba08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:46, skipping insertion in model container [2020-10-20 08:16:46,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:46,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:46" (3/3) ... [2020-10-20 08:16:46,270 INFO L373 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2020-10-20 08:16:46,334 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:16:46,334 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:16:46,334 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:16:46,335 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:16:46,335 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:16:46,335 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:16:46,336 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:16:46,336 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:16:46,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-20 08:16:46,378 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-20 08:16:46,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:46,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:46,387 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 08:16:46,387 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:46,387 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:16:46,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-20 08:16:46,391 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-20 08:16:46,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:46,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:46,392 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 08:16:46,392 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:46,401 INFO L794 eck$LassoCheckResult]: Stem: 30#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(11);~N~0 := 0; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 32#L44true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3#L18-3true [2020-10-20 08:16:46,401 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 7#L18-2true init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3#L18-3true [2020-10-20 08:16:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 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 [1661500541] [2020-10-20 08:16:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,577 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2020-10-20 08:16:46,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675515608] [2020-10-20 08:16:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,598 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2020-10-20 08:16:46,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:46,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926214257] [2020-10-20 08:16:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:46,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:46,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:47,093 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-10-20 08:16:47,218 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-20 08:16:47,230 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:47,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:47,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:47,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:47,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:47,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:47,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:47,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:47,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2020-10-20 08:16:47,233 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:47,233 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:47,257 INFO 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:47,264 INFO 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:47,267 INFO 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:47,271 INFO 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:47,276 INFO 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:47,279 INFO 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:47,281 INFO 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:47,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:47,287 INFO 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:47,291 INFO 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:47,294 INFO 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:47,297 INFO 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:47,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:47,303 INFO 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:47,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:47,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:47,312 INFO 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:47,315 INFO 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:47,332 INFO 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:47,335 INFO 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:47,554 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-20 08:16:47,956 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:47,961 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:47,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:47,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:47,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:47,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:47,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:47,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:47,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:47,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:47,980 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:48,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:48,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:48,025 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:48,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:48,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:48,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:48,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:48,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,174 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:48,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:48,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,216 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:48,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:48,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:48,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,284 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:48,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:48,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:48,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:48,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,356 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:48,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,385 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:48,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:48,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:48,421 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:48,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,450 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:48,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,483 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:48,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,515 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:48,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,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 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:48,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,587 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:48,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,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 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:48,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:48,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:48,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:48,644 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:48,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:48,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:48,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:48,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:48,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:48,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:48,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:48,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:48,882 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:16:48,883 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 12 variables to zero. 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:48,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:48,891 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:48,892 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:48,893 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2020-10-20 08:16:48,965 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 08:16:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:49,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:49,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:49,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:49,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:49,045 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:49,062 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:49,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2020-10-20 08:16:49,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 89 states and 135 transitions. Complement of second has 7 states. [2020-10-20 08:16:49,188 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:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:16:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2020-10-20 08:16:49,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-20 08:16:49,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:49,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-20 08:16:49,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:49,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-20 08:16:49,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:49,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 135 transitions. [2020-10-20 08:16:49,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:49,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 23 states and 33 transitions. [2020-10-20 08:16:49,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 08:16:49,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 08:16:49,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2020-10-20 08:16:49,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:49,216 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-20 08:16:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2020-10-20 08:16:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-20 08:16:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 08:16:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2020-10-20 08:16:49,297 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-20 08:16:49,297 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-20 08:16:49,297 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:16:49,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2020-10-20 08:16:49,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:49,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:49,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:49,299 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:16:49,302 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:49,303 INFO L794 eck$LassoCheckResult]: Stem: 227#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(11);~N~0 := 0; 224#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 225#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 206#L18-3 assume !(init_nondet_~i~0 < ~N~0); 207#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 210#L29-3 [2020-10-20 08:16:49,303 INFO L796 eck$LassoCheckResult]: Loop: 210#L29-3 assume !!(rangesum_~i~1 < ~N~0); 212#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 218#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 210#L29-3 [2020-10-20 08:16:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2020-10-20 08:16:49,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:49,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589565106] [2020-10-20 08:16:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:49,358 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:49,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589565106] [2020-10-20 08:16:49,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:16:49,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:16:49,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59442177] [2020-10-20 08:16:49,363 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2020-10-20 08:16:49,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:49,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637987416] [2020-10-20 08:16:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:49,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:49,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:49,379 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:49,422 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:49,422 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:49,422 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:49,422 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:49,423 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:16:49,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:49,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:49,423 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:49,423 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2020-10-20 08:16:49,423 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:49,423 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:49,424 INFO 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:49,435 INFO 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:49,467 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:49,467 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:49,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:16:49,473 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:49,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:16:49,518 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:49,754 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:16:49,756 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:49,756 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:49,756 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:49,756 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:49,756 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:49,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:49,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:49,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:49,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2020-10-20 08:16:49,757 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:49,757 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:49,758 INFO 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:49,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:49,801 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:49,801 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:49,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:49,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:49,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:49,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:49,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:49,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:49,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:49,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:49,827 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:49,836 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 08:16:49,836 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:49,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:49,848 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:16:49,848 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:49,848 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:49,880 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:16:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:49,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:49,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:49,951 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:16:49,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:49,995 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:49,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:16:49,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-10-20 08:16:50,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2020-10-20 08:16:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:16:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 08:16:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-10-20 08:16:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-20 08:16:50,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:50,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-20 08:16:50,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:50,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 08:16:50,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:50,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2020-10-20 08:16:50,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2020-10-20 08:16:50,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:16:50,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 08:16:50,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2020-10-20 08:16:50,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:50,042 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-10-20 08:16:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2020-10-20 08:16:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-20 08:16:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 08:16:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2020-10-20 08:16:50,047 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2020-10-20 08:16:50,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:16:50,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:16:50,053 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2020-10-20 08:16:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:50,106 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2020-10-20 08:16:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:16:50,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2020-10-20 08:16:50,109 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2020-10-20 08:16:50,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:16:50,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-20 08:16:50,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2020-10-20 08:16:50,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:50,111 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-20 08:16:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2020-10-20 08:16:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-20 08:16:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 08:16:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-10-20 08:16:50,115 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-20 08:16:50,115 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-20 08:16:50,115 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:16:50,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2020-10-20 08:16:50,116 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:50,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:50,117 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:50,117 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:50,117 INFO L794 eck$LassoCheckResult]: Stem: 399#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(11);~N~0 := 0; 396#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 397#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 373#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 374#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 375#L18-3 assume !(init_nondet_~i~0 < ~N~0); 376#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 386#L29-3 assume !!(rangesum_~i~1 < ~N~0); 379#L30 [2020-10-20 08:16:50,118 INFO L796 eck$LassoCheckResult]: Loop: 379#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 388#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 377#L29-3 assume !!(rangesum_~i~1 < ~N~0); 379#L30 [2020-10-20 08:16:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,118 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2020-10-20 08:16:50,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659603711] [2020-10-20 08:16:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:50,157 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:50,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659603711] [2020-10-20 08:16:50,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727575659] [2020-10-20 08:16:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:50,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:50,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:50,258 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:50,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:50,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-20 08:16:50,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310768492] [2020-10-20 08:16:50,260 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2020-10-20 08:16:50,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437503689] [2020-10-20 08:16:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,278 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:50,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:50,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:16:50,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:16:50,373 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2020-10-20 08:16:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:50,438 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2020-10-20 08:16:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:16:50,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2020-10-20 08:16:50,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2020-10-20 08:16:50,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:16:50,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-20 08:16:50,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2020-10-20 08:16:50,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:50,442 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-10-20 08:16:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2020-10-20 08:16:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-20 08:16:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:16:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-10-20 08:16:50,445 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-10-20 08:16:50,445 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-10-20 08:16:50,445 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:16:50,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2020-10-20 08:16:50,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:50,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:50,447 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:50,447 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:50,448 INFO L794 eck$LassoCheckResult]: Stem: 491#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(11);~N~0 := 0; 488#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 489#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 464#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 465#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 466#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 467#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 494#L18-3 assume !(init_nondet_~i~0 < ~N~0); 478#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 479#L29-3 assume !!(rangesum_~i~1 < ~N~0); 470#L30 [2020-10-20 08:16:50,448 INFO L796 eck$LassoCheckResult]: Loop: 470#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 480#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 468#L29-3 assume !!(rangesum_~i~1 < ~N~0); 470#L30 [2020-10-20 08:16:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2020-10-20 08:16:50,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480356485] [2020-10-20 08:16:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,488 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2020-10-20 08:16:50,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112107311] [2020-10-20 08:16:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,516 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2020-10-20 08:16:50,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189211876] [2020-10-20 08:16:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:16:50,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189211876] [2020-10-20 08:16:50,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:16:50,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:16:50,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742708897] [2020-10-20 08:16:50,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:16:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:16:50,675 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-10-20 08:16:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:50,753 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-10-20 08:16:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:16:50,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2020-10-20 08:16:50,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2020-10-20 08:16:50,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 08:16:50,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 08:16:50,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-10-20 08:16:50,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:50,757 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-10-20 08:16:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-10-20 08:16:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-20 08:16:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 08:16:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-10-20 08:16:50,760 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-20 08:16:50,760 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-20 08:16:50,760 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:16:50,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-10-20 08:16:50,761 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:50,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:50,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:50,762 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:50,762 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:50,762 INFO L794 eck$LassoCheckResult]: Stem: 572#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(11);~N~0 := 0; 569#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 570#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 544#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 545#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 546#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 547#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 578#L18-3 assume !(init_nondet_~i~0 < ~N~0); 556#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 548#L29-3 assume !!(rangesum_~i~1 < ~N~0); 549#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 567#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 577#L29-3 assume !!(rangesum_~i~1 < ~N~0); 566#L30 [2020-10-20 08:16:50,762 INFO L796 eck$LassoCheckResult]: Loop: 566#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 558#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 559#L29-3 assume !!(rangesum_~i~1 < ~N~0); 566#L30 [2020-10-20 08:16:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2020-10-20 08:16:50,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758520735] [2020-10-20 08:16:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2020-10-20 08:16:50,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708333576] [2020-10-20 08:16:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:50,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:50,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2020-10-20 08:16:50,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:50,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157269616] [2020-10-20 08:16:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:50,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157269616] [2020-10-20 08:16:50,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538649040] [2020-10-20 08:16:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:16:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:51,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:16:51,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:51,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:51,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-10-20 08:16:51,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590803057] [2020-10-20 08:16:51,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 08:16:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 08:16:51,221 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 13 states. [2020-10-20 08:16:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:51,566 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2020-10-20 08:16:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 08:16:51,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2020-10-20 08:16:51,569 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2020-10-20 08:16:51,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 70 states and 90 transitions. [2020-10-20 08:16:51,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-10-20 08:16:51,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 08:16:51,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2020-10-20 08:16:51,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:51,571 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-20 08:16:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2020-10-20 08:16:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2020-10-20 08:16:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 08:16:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2020-10-20 08:16:51,576 INFO L714 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-20 08:16:51,576 INFO L594 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-20 08:16:51,576 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:16:51,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2020-10-20 08:16:51,577 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-20 08:16:51,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:51,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:51,577 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:51,578 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:51,578 INFO L794 eck$LassoCheckResult]: Stem: 767#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(11);~N~0 := 0; 761#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 762#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 735#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 736#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 737#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 738#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 778#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 779#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 787#L18-3 assume !(init_nondet_~i~0 < ~N~0); 786#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 785#L29-3 assume !!(rangesum_~i~1 < ~N~0); 759#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 752#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 753#L29-3 assume !!(rangesum_~i~1 < ~N~0); 789#L30 [2020-10-20 08:16:51,578 INFO L796 eck$LassoCheckResult]: Loop: 789#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 791#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 790#L29-3 assume !!(rangesum_~i~1 < ~N~0); 789#L30 [2020-10-20 08:16:51,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2020-10-20 08:16:51,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:51,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348648968] [2020-10-20 08:16:51,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:51,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:51,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:51,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2020-10-20 08:16:51,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:51,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556087041] [2020-10-20 08:16:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:51,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:51,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:51,625 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:51,626 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2020-10-20 08:16:51,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:51,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063399626] [2020-10-20 08:16:51,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:51,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063399626] [2020-10-20 08:16:51,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211241580] [2020-10-20 08:16:51,763 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 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:51,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:51,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:51,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:16:51,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:51,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:51,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-10-20 08:16:51,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118109279] [2020-10-20 08:16:51,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 08:16:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-20 08:16:51,999 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 14 states. [2020-10-20 08:16:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:52,464 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-10-20 08:16:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 08:16:52,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2020-10-20 08:16:52,465 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2020-10-20 08:16:52,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 73 states and 87 transitions. [2020-10-20 08:16:52,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 08:16:52,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 08:16:52,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2020-10-20 08:16:52,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:52,471 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2020-10-20 08:16:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2020-10-20 08:16:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2020-10-20 08:16:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-20 08:16:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2020-10-20 08:16:52,477 INFO L714 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-10-20 08:16:52,478 INFO L594 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-10-20 08:16:52,478 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:16:52,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2020-10-20 08:16:52,479 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-20 08:16:52,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:52,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:52,480 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 08:16:52,480 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:52,480 INFO L794 eck$LassoCheckResult]: Stem: 983#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(11);~N~0 := 0; 978#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 979#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 954#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 955#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 956#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 957#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1016#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 992#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 991#L18-3 assume !(init_nondet_~i~0 < ~N~0); 967#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 958#L29-3 assume !!(rangesum_~i~1 < ~N~0); 959#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 970#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 960#L29-3 assume !!(rangesum_~i~1 < ~N~0); 961#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1012#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1008#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1007#L30 [2020-10-20 08:16:52,481 INFO L796 eck$LassoCheckResult]: Loop: 1007#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1011#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1006#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1007#L30 [2020-10-20 08:16:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 3 times [2020-10-20 08:16:52,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:52,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513170067] [2020-10-20 08:16:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:52,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:52,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:52,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2020-10-20 08:16:52,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:52,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953834700] [2020-10-20 08:16:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:52,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:52,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:52,524 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:52,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 3 times [2020-10-20 08:16:52,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:52,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598802252] [2020-10-20 08:16:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 08:16:52,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598802252] [2020-10-20 08:16:52,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406952235] [2020-10-20 08:16:52,668 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 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:52,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 08:16:52,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:52,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:16:52,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:52,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:52,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-20 08:16:52,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340039592] [2020-10-20 08:16:52,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 08:16:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-20 08:16:52,904 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 15 states. [2020-10-20 08:16:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:53,428 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2020-10-20 08:16:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 08:16:53,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2020-10-20 08:16:53,431 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2020-10-20 08:16:53,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2020-10-20 08:16:53,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-10-20 08:16:53,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2020-10-20 08:16:53,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2020-10-20 08:16:53,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:53,435 INFO L691 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2020-10-20 08:16:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2020-10-20 08:16:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2020-10-20 08:16:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 08:16:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2020-10-20 08:16:53,442 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-10-20 08:16:53,442 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-10-20 08:16:53,442 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:16:53,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2020-10-20 08:16:53,443 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-20 08:16:53,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:53,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:53,444 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 08:16:53,444 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:53,445 INFO L794 eck$LassoCheckResult]: Stem: 1276#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(11);~N~0 := 0; 1270#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1271#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1243#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1244#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1245#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1246#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1308#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1255#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1256#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1303#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1302#L18-3 assume !(init_nondet_~i~0 < ~N~0); 1301#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1300#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1268#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1261#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1262#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1299#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1297#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1294#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1295#L30 [2020-10-20 08:16:53,445 INFO L796 eck$LassoCheckResult]: Loop: 1295#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1298#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1296#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1295#L30 [2020-10-20 08:16:53,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 4 times [2020-10-20 08:16:53,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261404901] [2020-10-20 08:16:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,480 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2020-10-20 08:16:53,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681230763] [2020-10-20 08:16:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,491 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 4 times [2020-10-20 08:16:53,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077300081] [2020-10-20 08:16:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-20 08:16:53,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077300081] [2020-10-20 08:16:53,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157513130] [2020-10-20 08:16:53,574 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 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:53,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:16:53,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:53,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:16:53,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:16:53,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:53,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-10-20 08:16:53,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395979034] [2020-10-20 08:16:53,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:53,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 08:16:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-20 08:16:53,907 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 18 states. [2020-10-20 08:16:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:54,865 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2020-10-20 08:16:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-20 08:16:54,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 191 transitions. [2020-10-20 08:16:54,868 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 23 [2020-10-20 08:16:54,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 158 states and 185 transitions. [2020-10-20 08:16:54,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2020-10-20 08:16:54,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2020-10-20 08:16:54,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 185 transitions. [2020-10-20 08:16:54,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:54,873 INFO L691 BuchiCegarLoop]: Abstraction has 158 states and 185 transitions. [2020-10-20 08:16:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 185 transitions. [2020-10-20 08:16:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2020-10-20 08:16:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-20 08:16:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2020-10-20 08:16:54,892 INFO L714 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2020-10-20 08:16:54,892 INFO L594 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2020-10-20 08:16:54,893 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:16:54,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 165 transitions. [2020-10-20 08:16:54,894 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2020-10-20 08:16:54,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:54,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:54,896 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2020-10-20 08:16:54,897 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:54,897 INFO L794 eck$LassoCheckResult]: Stem: 1661#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(11);~N~0 := 0; 1657#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1658#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1631#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1632#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1633#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1634#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1709#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1710#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1721#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1675#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1676#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1671#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1669#L18-3 assume !(init_nondet_~i~0 < ~N~0); 1670#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1635#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1636#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1648#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1637#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1638#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1739#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1740#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1731#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1730#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1723#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1726#L30 [2020-10-20 08:16:54,897 INFO L796 eck$LassoCheckResult]: Loop: 1726#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1646#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1647#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1726#L30 [2020-10-20 08:16:54,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 5 times [2020-10-20 08:16:54,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166451925] [2020-10-20 08:16:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 7 times [2020-10-20 08:16:54,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719467142] [2020-10-20 08:16:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 5 times [2020-10-20 08:16:54,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979176420] [2020-10-20 08:16:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:55,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:55,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:55,043 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:56,694 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 209 DAG size of output: 152 [2020-10-20 08:16:57,050 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-20 08:16:57,052 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:57,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:57,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:57,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:57,053 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:57,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:57,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:57,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:57,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2020-10-20 08:16:57,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:57,054 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:57,058 INFO 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:57,070 INFO 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:57,413 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-20 08:16:57,457 INFO 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:57,459 INFO 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:57,461 INFO 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:57,464 INFO 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:57,467 INFO 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:57,470 INFO 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:57,472 INFO 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:57,475 INFO 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:57,478 INFO 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:57,482 INFO 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:57,492 INFO 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:57,495 INFO 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:57,497 INFO 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:57,500 INFO 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:57,502 INFO 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:57,505 INFO 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:57,507 INFO 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:57,510 INFO 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:57,512 INFO 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:57,514 INFO 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:57,517 INFO 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:57,520 INFO 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:57,522 INFO 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:57,963 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:57,964 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:57,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:57,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:57,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:57,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:57,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:57,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:57,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:57,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:57,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:57,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:57,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:57,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:57,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:57,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:58,013 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:58,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:58,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:58,061 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:58,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:58,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:58,096 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) [2020-10-20 08:16:58,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:58,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:58,139 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:58,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:58,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:58,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:58,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:58,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:58,214 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:58,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:58,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:58,251 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:58,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:58,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:58,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:58,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:58,280 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:58,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:58,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:58,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:58,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:58,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:58,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:58,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:58,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:58,350 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 08:16:58,351 INFO L444 ModelExtractionUtils]: 19 out of 34 variables were initially zero. Simplification set additionally 12 variables to zero. 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:58,353 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:58,355 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:58,355 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:58,355 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -1*ULTIMATE.start_rangesum_~i~1 + 1*~N~0 Supporting invariants [] [2020-10-20 08:16:58,424 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 08:16:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:58,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:58,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:58,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:58,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:58,483 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:58,484 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:58,484 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 165 transitions. cyclomatic complexity: 37 Second operand 4 states. [2020-10-20 08:16:58,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 165 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 178 states and 215 transitions. Complement of second has 7 states. [2020-10-20 08:16:58,534 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:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 08:16:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 08:16:58,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-20 08:16:58,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:58,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-20 08:16:58,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:58,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-20 08:16:58,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:58,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 215 transitions. [2020-10-20 08:16:58,538 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2020-10-20 08:16:58,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 148 states and 176 transitions. [2020-10-20 08:16:58,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2020-10-20 08:16:58,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2020-10-20 08:16:58,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 176 transitions. [2020-10-20 08:16:58,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:16:58,541 INFO L691 BuchiCegarLoop]: Abstraction has 148 states and 176 transitions. [2020-10-20 08:16:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 176 transitions. [2020-10-20 08:16:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2020-10-20 08:16:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-20 08:16:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2020-10-20 08:16:58,547 INFO L714 BuchiCegarLoop]: Abstraction has 142 states and 170 transitions. [2020-10-20 08:16:58,548 INFO L594 BuchiCegarLoop]: Abstraction has 142 states and 170 transitions. [2020-10-20 08:16:58,548 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:16:58,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 170 transitions. [2020-10-20 08:16:58,549 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2020-10-20 08:16:58,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:58,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:58,550 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:58,550 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:58,551 INFO L794 eck$LassoCheckResult]: Stem: 2129#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(11);~N~0 := 0; 2126#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 2127#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2100#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2101#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2171#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2170#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2168#L18-3 assume !(init_nondet_~i~0 < ~N~0); 2167#L16 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2166#L29-3 assume !!(rangesum_~i~1 < ~N~0); 2165#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2164#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2163#L29-3 assume !!(rangesum_~i~1 < ~N~0); 2162#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2161#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2159#L29-3 assume !(rangesum_~i~1 < ~N~0); 2157#L29-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2155#L38 main_#t~ret8 := rangesum_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2153#L29-8 assume !!(rangesum_~i~1 < ~N~0); 2151#L30-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2149#L29-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2147#L29-8 assume !!(rangesum_~i~1 < ~N~0); 2145#L30-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2144#L29-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2140#L29-8 assume !(rangesum_~i~1 < ~N~0); 2139#L29-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2138#L38-1 main_#t~ret11 := rangesum_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~2 := 0; 2132#L57-3 [2020-10-20 08:16:58,551 INFO L796 eck$LassoCheckResult]: Loop: 2132#L57-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem14; 2133#L57-2 main_#t~post13 := main_~i~2;main_~i~2 := 1 + main_#t~post13;havoc main_#t~post13; 2132#L57-3 [2020-10-20 08:16:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2020-10-20 08:16:58,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255173179] [2020-10-20 08:16:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2020-10-20 08:16:58,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155088195] [2020-10-20 08:16:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2020-10-20 08:16:58,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444718298] [2020-10-20 08:16:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,619 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:59,985 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 215 DAG size of output: 178 [2020-10-20 08:17:05,788 WARN L193 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 168 DAG size of output: 147 [2020-10-20 08:17:05,793 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:05,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:05,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:05,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:05,794 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:05,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:05,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:05,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:05,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2020-10-20 08:17:05,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:05,795 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:05,805 INFO 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:17:05,807 INFO 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:17:05,809 INFO 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:17:05,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:17:05,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:17:05,817 INFO 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:17:05,819 INFO 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:17:05,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:17:05,822 INFO 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:17:05,824 INFO 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:17:06,246 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-20 08:17:06,250 INFO L168 Benchmark]: Toolchain (without parser) took 20966.41 ms. Allocated memory was 36.7 MB in the beginning and 119.0 MB in the end (delta: 82.3 MB). Free memory was 15.5 MB in the beginning and 30.5 MB in the end (delta: -15.0 MB). Peak memory consumption was 86.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:06,253 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 34.6 MB. Free memory was 9.2 MB in the beginning and 9.1 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:17:06,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.88 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 14.6 MB in the beginning and 24.4 MB in the end (delta: -9.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:06,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 44.0 MB. Free memory was 24.4 MB in the beginning and 22.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:06,257 INFO L168 Benchmark]: Boogie Preprocessor took 36.32 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 20.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:06,259 INFO L168 Benchmark]: RCFGBuilder took 456.29 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 20.4 MB in the beginning and 11.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 10.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:06,259 INFO L168 Benchmark]: BuchiAutomizer took 19990.08 ms. Allocated memory was 45.6 MB in the beginning and 119.0 MB in the end (delta: 73.4 MB). Free memory was 11.0 MB in the beginning and 30.5 MB in the end (delta: -19.5 MB). Peak memory consumption was 72.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:06,265 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.27 ms. Allocated memory is still 34.6 MB. Free memory was 9.2 MB in the beginning and 9.1 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 417.88 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 14.6 MB in the beginning and 24.4 MB in the end (delta: -9.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 44.0 MB. Free memory was 24.4 MB in the beginning and 22.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 36.32 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 20.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 456.29 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 20.4 MB in the beginning and 11.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 10.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 19990.08 ms. Allocated memory was 45.6 MB in the beginning and 119.0 MB in the end (delta: 73.4 MB). Free memory was 11.0 MB in the beginning and 30.5 MB in the end (delta: -19.5 MB). Peak memory consumption was 72.7 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...