./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 54858612 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.5.800.v20200727-1323.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.2.0-5485861 [2020-10-26 06:00:51,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:00:51,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:00:51,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:00:51,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:00:51,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:00:51,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:00:51,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:00:51,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:00:51,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:00:51,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:00:51,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:00:51,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:00:51,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:00:51,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:00:51,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:00:51,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:00:51,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:00:51,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:00:51,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:00:51,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:00:51,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:00:51,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:00:51,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:00:51,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:00:51,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:00:51,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:00:51,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:00:51,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:00:51,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:00:51,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:00:51,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:00:51,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:00:51,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:00:51,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:00:51,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:00:51,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:00:51,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:00:51,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:00:51,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:00:51,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:00:51,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 06:00:51,531 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:00:51,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:00:51,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:00:51,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:00:51,534 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:00:51,534 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:00:51,534 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:00:51,535 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:00:51,535 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:00:51,535 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:00:51,536 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:00:51,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:00:51,536 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:00:51,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:00:51,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:00:51,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:00:51,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:00:51,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:00:51,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:00:51,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:00:51,538 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:00:51,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:00:51,539 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:00:51,539 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:00:51,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:00:51,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:00:51,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:00:51,540 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:00:51,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:00:51,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:00:51,541 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:00:51,541 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:00:51,543 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:00:51,543 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-26 06:00:51,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:00:51,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:00:51,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:00:51,941 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:00:51,944 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:00:51,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2020-10-26 06:00:52,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c2d9ce5/c931fc8cad8a4838b637e3d7d65cbac0/FLAGa30101442 [2020-10-26 06:00:52,596 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:00:52,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2020-10-26 06:00:52,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c2d9ce5/c931fc8cad8a4838b637e3d7d65cbac0/FLAGa30101442 [2020-10-26 06:00:52,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c2d9ce5/c931fc8cad8a4838b637e3d7d65cbac0 [2020-10-26 06:00:52,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:00:52,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:00:53,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:00:53,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:00:53,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:00:53,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:00:52" (1/1) ... [2020-10-26 06:00:53,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1456949c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53, skipping insertion in model container [2020-10-26 06:00:53,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:00:52" (1/1) ... [2020-10-26 06:00:53,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:00:53,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:00:53,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:00:53,293 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:00:53,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:00:53,334 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:00:53,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53 WrapperNode [2020-10-26 06:00:53,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:00:53,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:00:53,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:00:53,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:00:53,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:00:53,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:00:53,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:00:53,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:00:53,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (1/1) ... [2020-10-26 06:00:53,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:00:53,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:00:53,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:00:53,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:00:53,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (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-26 06:00:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 06:00:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:00:53,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 06:00:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:00:53,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:00:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 06:00:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:00:53,854 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:00:53,855 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-26 06:00:53,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:53 BoogieIcfgContainer [2020-10-26 06:00:53,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:00:53,859 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:00:53,859 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:00:53,863 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:00:53,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:53,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:00:52" (1/3) ... [2020-10-26 06:00:53,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32c9340b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:00:53, skipping insertion in model container [2020-10-26 06:00:53,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:53,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:53" (2/3) ... [2020-10-26 06:00:53,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32c9340b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:00:53, skipping insertion in model container [2020-10-26 06:00:53,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:53,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:53" (3/3) ... [2020-10-26 06:00:53,868 INFO L373 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2020-10-26 06:00:53,981 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:00:53,981 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:00:53,981 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:00:53,981 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:00:53,982 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:00:53,982 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:00:53,982 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:00:53,982 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:00:54,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-26 06:00:54,035 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-26 06:00:54,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:54,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:54,040 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 06:00:54,040 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:54,041 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:00:54,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-26 06:00:54,044 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-26 06:00:54,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:54,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:54,045 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 06:00:54,045 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:54,052 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-26 06:00:54,052 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-26 06:00:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-26 06:00:54,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:54,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859455914] [2020-10-26 06:00:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:54,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:54,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:54,227 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2020-10-26 06:00:54,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:54,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650872037] [2020-10-26 06:00:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:54,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:54,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:54,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2020-10-26 06:00:54,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:54,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018141957] [2020-10-26 06:00:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:54,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:54,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:54,379 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:54,727 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-10-26 06:00:54,856 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:54,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:54,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:54,858 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:54,858 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:54,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:54,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:54,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:54,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2020-10-26 06:00:54,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:54,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:54,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:54,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:55,194 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-26 06:00:55,596 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:55,601 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:55,612 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-26 06:00:55,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:55,626 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:55,662 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-26 06:00:55,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:55,667 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-26 06:00:55,699 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-26 06:00:55,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:55,711 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-26 06:00:55,740 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-26 06:00:55,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:55,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:55,755 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-26 06:00:55,794 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-26 06:00:55,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,798 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-26 06:00:55,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:55,831 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-26 06:00:55,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:55,840 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-26 06:00:55,881 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-26 06:00:55,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:55,892 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-26 06:00:55,921 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-26 06:00:55,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:55,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:55,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:55,936 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) [2020-10-26 06:00:55,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:55,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:55,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:55,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:55,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:55,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:55,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:55,987 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-26 06:00:56,016 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-26 06:00:56,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:56,026 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-26 06:00:56,070 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-26 06:00:56,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:56,075 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-26 06:00:56,111 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-26 06:00:56,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:56,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:56,125 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) [2020-10-26 06:00:56,163 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-26 06:00:56,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:56,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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:56,217 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-26 06:00:56,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:56,229 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-26 06:00:56,258 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-26 06:00:56,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:56,270 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-26 06:00:56,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:56,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:56,305 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-26 06:00:56,330 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-26 06:00:56,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:56,336 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) [2020-10-26 06:00:56,376 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-26 06:00:56,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:56,382 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) [2020-10-26 06:00:56,425 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-26 06:00:56,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:56,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:56,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:56,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 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 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-26 06:00:56,462 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-26 06:00:56,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:56,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:56,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:56,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:56,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:56,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:56,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:00:56,539 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 06:00:56,539 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-26 06:00:56,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:00:56,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:00:56,562 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:00:56,563 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-26 06:00:56,721 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-26 06:00:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:56,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:00:56,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:56,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:00:56,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:56,802 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-26 06:00:56,819 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-26 06:00:56,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2020-10-26 06:00:56,987 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-26 06:00:56,988 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-26 06:00:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:00:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2020-10-26 06:00:56,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-26 06:00:56,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:56,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-26 06:00:56,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:56,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-26 06:00:56,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:56,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 135 transitions. [2020-10-26 06:00:57,002 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:57,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 23 states and 33 transitions. [2020-10-26 06:00:57,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-26 06:00:57,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-26 06:00:57,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2020-10-26 06:00:57,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:57,009 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-26 06:00:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2020-10-26 06:00:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-26 06:00:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-26 06:00:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2020-10-26 06:00:57,039 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-26 06:00:57,039 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-26 06:00:57,039 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:00:57,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2020-10-26 06:00:57,041 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:57,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:57,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:57,042 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 06:00:57,042 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:00:57,042 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-26 06:00:57,042 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-26 06:00:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2020-10-26 06:00:57,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:57,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955034093] [2020-10-26 06:00:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:57,094 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-26 06:00:57,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955034093] [2020-10-26 06:00:57,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:00:57,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 06:00:57,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930419317] [2020-10-26 06:00:57,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2020-10-26 06:00:57,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:57,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126427880] [2020-10-26 06:00:57,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:57,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:57,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:57,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:57,176 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:57,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:57,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:57,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:57,176 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 06:00:57,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:57,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:57,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:57,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2020-10-26 06:00:57,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:57,177 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:57,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:57,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:57,226 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:57,227 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-26 06:00:57,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 06:00:57,233 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-26 06:00:57,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 06:00:57,271 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-26 06:00:57,442 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 06:00:57,444 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:57,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:57,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:57,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:57,444 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:57,444 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:57,444 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:57,444 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:57,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2020-10-26 06:00:57,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:57,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:57,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:57,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:57,513 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-26 06:00:57,518 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-26 06:00:57,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:57,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:57,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:57,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:57,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:57,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:57,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:57,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:57,551 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-26 06:00:57,551 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:57,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:00:57,558 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 06:00:57,558 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:00:57,558 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 [] [2020-10-26 06:00:57,585 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 06:00:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:57,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:00:57,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:57,632 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:00:57,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:57,682 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-26 06:00:57,683 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-26 06:00:57,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-10-26 06:00:57,725 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-26 06:00:57,725 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-26 06:00:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 06:00:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-10-26 06:00:57,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-26 06:00:57,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:57,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-26 06:00:57,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:57,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-26 06:00:57,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:57,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2020-10-26 06:00:57,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:57,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2020-10-26 06:00:57,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 06:00:57,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-26 06:00:57,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2020-10-26 06:00:57,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:00:57,740 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-10-26 06:00:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2020-10-26 06:00:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-26 06:00:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-26 06:00:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2020-10-26 06:00:57,743 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2020-10-26 06:00:57,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 06:00:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 06:00:57,751 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2020-10-26 06:00:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:57,816 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2020-10-26 06:00:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 06:00:57,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2020-10-26 06:00:57,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:57,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2020-10-26 06:00:57,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 06:00:57,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-26 06:00:57,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2020-10-26 06:00:57,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:00:57,820 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-26 06:00:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2020-10-26 06:00:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-26 06:00:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-26 06:00:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-10-26 06:00:57,823 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-26 06:00:57,823 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-26 06:00:57,823 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:00:57,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2020-10-26 06:00:57,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:57,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:57,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:57,824 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:00:57,824 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:00:57,825 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-26 06:00:57,825 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-26 06:00:57,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:57,825 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2020-10-26 06:00:57,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:57,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798054506] [2020-10-26 06:00:57,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:57,872 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-26 06:00:57,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798054506] [2020-10-26 06:00:57,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26498247] [2020-10-26 06:00:57,873 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-26 06:00:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:57,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:00:57,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:57,961 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-26 06:00:57,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:57,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-26 06:00:57,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37413316] [2020-10-26 06:00:57,963 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:57,963 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2020-10-26 06:00:57,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:57,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048148023] [2020-10-26 06:00:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:57,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:57,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:57,980 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:58,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:58,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 06:00:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 06:00:58,070 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2020-10-26 06:00:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:58,132 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2020-10-26 06:00:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:00:58,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2020-10-26 06:00:58,134 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:58,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2020-10-26 06:00:58,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 06:00:58,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-26 06:00:58,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2020-10-26 06:00:58,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:00:58,136 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-10-26 06:00:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2020-10-26 06:00:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-26 06:00:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 06:00:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-10-26 06:00:58,139 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-10-26 06:00:58,139 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-10-26 06:00:58,139 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:00:58,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2020-10-26 06:00:58,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:58,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:58,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:58,140 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-26 06:00:58,140 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:00:58,141 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-26 06:00:58,141 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-26 06:00:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2020-10-26 06:00:58,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:58,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661501930] [2020-10-26 06:00:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,191 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2020-10-26 06:00:58,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:58,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300051302] [2020-10-26 06:00:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,209 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2020-10-26 06:00:58,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:58,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692690661] [2020-10-26 06:00:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:58,307 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-26 06:00:58,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692690661] [2020-10-26 06:00:58,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:00:58,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:00:58,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20008878] [2020-10-26 06:00:58,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 06:00:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 06:00:58,411 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-10-26 06:00:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:58,493 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-10-26 06:00:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:00:58,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2020-10-26 06:00:58,495 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:58,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2020-10-26 06:00:58,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-26 06:00:58,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-26 06:00:58,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-10-26 06:00:58,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:00:58,496 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-10-26 06:00:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-10-26 06:00:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-26 06:00:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-26 06:00:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-10-26 06:00:58,499 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-26 06:00:58,499 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-26 06:00:58,500 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:00:58,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-10-26 06:00:58,500 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-26 06:00:58,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:58,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:58,501 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:00:58,501 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:00:58,501 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-26 06:00:58,502 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-26 06:00:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2020-10-26 06:00:58,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:58,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707816127] [2020-10-26 06:00:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:58,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:58,595 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2020-10-26 06:00:58,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:58,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135663657] [2020-10-26 06:00:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:58,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:58,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:58,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2020-10-26 06:00:58,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:58,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739330663] [2020-10-26 06:00:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:58,720 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-26 06:00:58,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739330663] [2020-10-26 06:00:58,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560815745] [2020-10-26 06:00:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 06:00:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:58,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:00:58,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:58,853 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-26 06:00:58,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:58,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-10-26 06:00:58,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21146102] [2020-10-26 06:00:58,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 06:00:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-26 06:00:58,967 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 13 states. [2020-10-26 06:00:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:59,394 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2020-10-26 06:00:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 06:00:59,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2020-10-26 06:00:59,397 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2020-10-26 06:00:59,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 70 states and 90 transitions. [2020-10-26 06:00:59,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-10-26 06:00:59,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-26 06:00:59,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2020-10-26 06:00:59,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:00:59,399 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-26 06:00:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2020-10-26 06:00:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2020-10-26 06:00:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-26 06:00:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2020-10-26 06:00:59,404 INFO L714 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-26 06:00:59,404 INFO L594 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-26 06:00:59,404 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:00:59,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2020-10-26 06:00:59,405 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-26 06:00:59,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:59,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:59,406 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:00:59,407 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:00:59,407 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-26 06:00:59,407 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-26 06:00:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2020-10-26 06:00:59,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:59,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484167319] [2020-10-26 06:00:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:59,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:59,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:59,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2020-10-26 06:00:59,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:59,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066725488] [2020-10-26 06:00:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:59,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:59,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:59,467 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2020-10-26 06:00:59,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:59,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461682186] [2020-10-26 06:00:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:59,651 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-26 06:00:59,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461682186] [2020-10-26 06:00:59,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710133000] [2020-10-26 06:00:59,651 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-26 06:00:59,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:00:59,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:59,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:00:59,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:59,817 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-26 06:00:59,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:59,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-10-26 06:00:59,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409629543] [2020-10-26 06:00:59,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-26 06:00:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-26 06:00:59,904 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 14 states. [2020-10-26 06:01:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:00,332 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-10-26 06:01:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 06:01:00,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2020-10-26 06:01:00,334 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2020-10-26 06:01:00,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 73 states and 87 transitions. [2020-10-26 06:01:00,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-26 06:01:00,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-26 06:01:00,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2020-10-26 06:01:00,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:01:00,335 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2020-10-26 06:01:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2020-10-26 06:01:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2020-10-26 06:01:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-26 06:01:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2020-10-26 06:01:00,341 INFO L714 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-10-26 06:01:00,341 INFO L594 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-10-26 06:01:00,341 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 06:01:00,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2020-10-26 06:01:00,342 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-26 06:01:00,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:00,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:00,344 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 06:01:00,344 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:01:00,344 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-26 06:01:00,344 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-26 06:01:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 3 times [2020-10-26 06:01:00,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:00,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379019143] [2020-10-26 06:01:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:00,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:00,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:00,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2020-10-26 06:01:00,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:00,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56679552] [2020-10-26 06:01:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:00,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:00,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:00,385 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 3 times [2020-10-26 06:01:00,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:00,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671697041] [2020-10-26 06:01:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:00,480 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-26 06:01:00,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671697041] [2020-10-26 06:01:00,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104893502] [2020-10-26 06:01:00,481 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-26 06:01:00,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-26 06:01:00,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:00,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:01:00,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:00,648 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-26 06:01:00,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:00,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-26 06:01:00,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409291742] [2020-10-26 06:01:00,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-26 06:01:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-26 06:01:00,737 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 15 states. [2020-10-26 06:01:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:01,300 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2020-10-26 06:01:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-26 06:01:01,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2020-10-26 06:01:01,304 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2020-10-26 06:01:01,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2020-10-26 06:01:01,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-10-26 06:01:01,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2020-10-26 06:01:01,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2020-10-26 06:01:01,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:01:01,307 INFO L691 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2020-10-26 06:01:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2020-10-26 06:01:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2020-10-26 06:01:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-26 06:01:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2020-10-26 06:01:01,313 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-10-26 06:01:01,313 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-10-26 06:01:01,313 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 06:01:01,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2020-10-26 06:01:01,315 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-26 06:01:01,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:01,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:01,315 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 06:01:01,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:01:01,316 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-26 06:01:01,316 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-26 06:01:01,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 4 times [2020-10-26 06:01:01,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787740227] [2020-10-26 06:01:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2020-10-26 06:01:01,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152281099] [2020-10-26 06:01:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 4 times [2020-10-26 06:01:01,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650404088] [2020-10-26 06:01:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,506 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-26 06:01:01,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650404088] [2020-10-26 06:01:01,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894927440] [2020-10-26 06:01:01,507 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-26 06:01:01,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 06:01:01,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:01,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:01:01,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:01,717 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-26 06:01:01,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:01,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-10-26 06:01:01,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854166154] [2020-10-26 06:01:01,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:01,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-26 06:01:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-26 06:01:01,808 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 18 states. [2020-10-26 06:01:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:02,889 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2020-10-26 06:01:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-26 06:01:02,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 191 transitions. [2020-10-26 06:01:02,893 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 23 [2020-10-26 06:01:02,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 158 states and 185 transitions. [2020-10-26 06:01:02,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2020-10-26 06:01:02,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2020-10-26 06:01:02,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 185 transitions. [2020-10-26 06:01:02,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:01:02,895 INFO L691 BuchiCegarLoop]: Abstraction has 158 states and 185 transitions. [2020-10-26 06:01:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 185 transitions. [2020-10-26 06:01:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2020-10-26 06:01:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-26 06:01:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2020-10-26 06:01:02,904 INFO L714 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2020-10-26 06:01:02,904 INFO L594 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2020-10-26 06:01:02,904 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 06:01:02,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 165 transitions. [2020-10-26 06:01:02,905 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2020-10-26 06:01:02,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:02,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:02,906 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2020-10-26 06:01:02,906 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:01:02,907 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-26 06:01:02,907 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-26 06:01:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 5 times [2020-10-26 06:01:02,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872499441] [2020-10-26 06:01:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 7 times [2020-10-26 06:01:02,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385859358] [2020-10-26 06:01:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,948 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 5 times [2020-10-26 06:01:02,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005813225] [2020-10-26 06:01:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:04,558 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 209 DAG size of output: 152 [2020-10-26 06:01:04,905 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-26 06:01:04,914 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:01:04,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:01:04,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:01:04,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:01:04,914 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:01:04,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:04,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:01:04,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:01:04,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2020-10-26 06:01:04,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:01:04,915 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:01:04,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:04,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,285 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-26 06:01:05,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:05,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:01:05,977 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) [2020-10-26 06:01:05,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-26 06:01:05,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:05,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:05,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:05,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:05,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:06,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,002 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-26 06:01:06,036 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-26 06:01:06,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:06,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:06,080 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-26 06:01:06,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,090 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) [2020-10-26 06:01:06,125 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-26 06:01:06,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,133 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-26 06:01:06,167 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-26 06:01:06,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,170 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-26 06:01:06,175 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) [2020-10-26 06:01:06,209 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-26 06:01:06,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:06,258 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-26 06:01:06,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,266 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) [2020-10-26 06:01:06,301 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-26 06:01:06,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,310 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) [2020-10-26 06:01:06,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-26 06:01:06,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:06,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:06,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,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 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-26 06:01:06,388 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-26 06:01:06,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:06,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:06,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:06,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:06,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:06,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:06,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:01:06,446 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-26 06:01:06,446 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) [2020-10-26 06:01:06,449 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:06,452 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:01:06,452 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:01:06,452 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-26 06:01:06,564 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-26 06:01:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:06,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:01:06,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:06,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:01:06,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:06,633 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-26 06:01:06,634 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-26 06:01:06,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 165 transitions. cyclomatic complexity: 37 Second operand 4 states. [2020-10-26 06:01:06,675 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-26 06:01:06,677 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-26 06:01:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 06:01:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-26 06:01:06,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-26 06:01:06,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:06,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-26 06:01:06,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:06,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-26 06:01:06,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:06,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 215 transitions. [2020-10-26 06:01:06,681 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2020-10-26 06:01:06,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 148 states and 176 transitions. [2020-10-26 06:01:06,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2020-10-26 06:01:06,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2020-10-26 06:01:06,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 176 transitions. [2020-10-26 06:01:06,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:01:06,683 INFO L691 BuchiCegarLoop]: Abstraction has 148 states and 176 transitions. [2020-10-26 06:01:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 176 transitions. [2020-10-26 06:01:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2020-10-26 06:01:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-26 06:01:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2020-10-26 06:01:06,690 INFO L714 BuchiCegarLoop]: Abstraction has 142 states and 170 transitions. [2020-10-26 06:01:06,691 INFO L594 BuchiCegarLoop]: Abstraction has 142 states and 170 transitions. [2020-10-26 06:01:06,691 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 06:01:06,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 170 transitions. [2020-10-26 06:01:06,692 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2020-10-26 06:01:06,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:06,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:06,693 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-26 06:01:06,693 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:01:06,693 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-26 06:01:06,694 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-26 06:01:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2020-10-26 06:01:06,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28159280] [2020-10-26 06:01:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,724 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2020-10-26 06:01:06,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995956240] [2020-10-26 06:01:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,731 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2020-10-26 06:01:06,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547130552] [2020-10-26 06:01:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:08,179 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 215 DAG size of output: 178 [2020-10-26 06:01:13,879 WARN L193 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 168 DAG size of output: 147 [2020-10-26 06:01:13,884 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:01:13,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:01:13,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:01:13,884 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:01:13,884 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:01:13,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:13,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:01:13,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:01:13,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2020-10-26 06:01:13,885 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:01:13,885 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:01:13,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:13,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:01:14,256 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:63) [2020-10-26 06:01:14,262 INFO L168 Benchmark]: Toolchain (without parser) took 21282.00 ms. Allocated memory was 46.1 MB in the beginning and 207.6 MB in the end (delta: 161.5 MB). Free memory was 22.9 MB in the beginning and 87.5 MB in the end (delta: -64.6 MB). Peak memory consumption was 122.5 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:14,262 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 46.1 MB. Free memory was 25.4 MB in the beginning and 25.3 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:01:14,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.19 ms. Allocated memory is still 65.0 MB. Free memory was 50.3 MB in the beginning and 40.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:14,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.25 ms. Allocated memory is still 65.0 MB. Free memory was 40.5 MB in the beginning and 38.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:14,263 INFO L168 Benchmark]: Boogie Preprocessor took 33.58 ms. Allocated memory is still 65.0 MB. Free memory was 38.5 MB in the beginning and 36.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:14,264 INFO L168 Benchmark]: RCFGBuilder took 438.61 ms. Allocated memory is still 65.0 MB. Free memory was 36.9 MB in the beginning and 34.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:14,265 INFO L168 Benchmark]: BuchiAutomizer took 20401.84 ms. Allocated memory was 65.0 MB in the beginning and 207.6 MB in the end (delta: 142.6 MB). Free memory was 34.0 MB in the beginning and 87.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 113.2 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:14,268 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.68 ms. Allocated memory is still 46.1 MB. Free memory was 25.4 MB in the beginning and 25.3 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 328.19 ms. Allocated memory is still 65.0 MB. Free memory was 50.3 MB in the beginning and 40.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.25 ms. Allocated memory is still 65.0 MB. Free memory was 40.5 MB in the beginning and 38.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.58 ms. Allocated memory is still 65.0 MB. Free memory was 38.5 MB in the beginning and 36.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 438.61 ms. Allocated memory is still 65.0 MB. Free memory was 36.9 MB in the beginning and 34.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 20401.84 ms. Allocated memory was 65.0 MB in the beginning and 207.6 MB in the end (delta: 142.6 MB). Free memory was 34.0 MB in the beginning and 87.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 113.2 MB. Max. memory is 16.1 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...