./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 111460b358d4c09612932eb239746dbb8202adb9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:26,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:02:26,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:02:26,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:02:26,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:02:26,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:02:26,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:02:26,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:02:26,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:02:26,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:02:26,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:02:26,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:02:26,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:02:26,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:02:26,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:02:26,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:02:26,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:02:26,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:02:26,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:02:26,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:02:26,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:02:26,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:02:26,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:02:26,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:02:26,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:02:26,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:02:26,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:02:26,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:02:26,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:02:26,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:02:26,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:02:26,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:02:26,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:02:26,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:02:26,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:02:26,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:02:26,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:02:26,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:02:26,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:02:26,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:02:26,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:02:26,650 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:02:26,686 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:02:26,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:02:26,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:02:26,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:02:26,689 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:02:26,689 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:02:26,689 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:02:26,689 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:02:26,690 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:02:26,690 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:02:26,690 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:02:26,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:02:26,690 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:02:26,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:02:26,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:02:26,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:02:26,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:02:26,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:02:26,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:02:26,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:02:26,692 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:02:26,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:02:26,692 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:02:26,693 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:02:26,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:02:26,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:02:26,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:02:26,694 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:02:26,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:02:26,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:02:26,694 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:02:26,694 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:02:26,696 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:02:26,696 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 -> 111460b358d4c09612932eb239746dbb8202adb9 [2020-10-26 06:02:27,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:02:27,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:02:27,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:02:27,156 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:02:27,157 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:02:27,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-10-26 06:02:27,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7754bc62b/75b343a1b2d04c23a8c9cb47753be083/FLAG1eb559f52 [2020-10-26 06:02:28,023 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:02:28,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-10-26 06:02:28,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7754bc62b/75b343a1b2d04c23a8c9cb47753be083/FLAG1eb559f52 [2020-10-26 06:02:28,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7754bc62b/75b343a1b2d04c23a8c9cb47753be083 [2020-10-26 06:02:28,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:02:28,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:02:28,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:02:28,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:02:28,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:02:28,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c5dc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28, skipping insertion in model container [2020-10-26 06:02:28,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:02:28,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:02:28,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:02:28,763 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:02:28,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:02:28,885 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:02:28,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28 WrapperNode [2020-10-26 06:02:28,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:02:28,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:02:28,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:02:28,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:02:28,897 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:02:28" (1/1) ... [2020-10-26 06:02:28,913 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:02:28" (1/1) ... [2020-10-26 06:02:28,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:02:28,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:02:28,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:02:28,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:02:28,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (1/1) ... [2020-10-26 06:02:28,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:02:28,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:02:28,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:02:28,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:02:28,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (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:02:29,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 06:02:29,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 06:02:29,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:02:29,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:02:29,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:02:29,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:02:29,673 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:02:29,673 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-26 06:02:29,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:02:29 BoogieIcfgContainer [2020-10-26 06:02:29,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:02:29,676 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:02:29,676 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:02:29,681 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:02:29,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:02:29,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:02:28" (1/3) ... [2020-10-26 06:02:29,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50949275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:02:29, skipping insertion in model container [2020-10-26 06:02:29,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:02:29,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:28" (2/3) ... [2020-10-26 06:02:29,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50949275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:02:29, skipping insertion in model container [2020-10-26 06:02:29,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:02:29,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:02:29" (3/3) ... [2020-10-26 06:02:29,686 INFO L373 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2020-10-26 06:02:29,746 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:02:29,746 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:02:29,746 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:02:29,746 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:02:29,746 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:02:29,746 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:02:29,747 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:02:29,747 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:02:29,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-26 06:02:29,787 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-10-26 06:02:29,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:29,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:29,795 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 06:02:29,795 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:29,795 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:02:29,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-26 06:02:29,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-10-26 06:02:29,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:29,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:29,799 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 06:02:29,799 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:29,808 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 23#L535-3true [2020-10-26 06:02:29,809 INFO L796 eck$LassoCheckResult]: Loop: 23#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 10#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 23#L535-3true [2020-10-26 06:02:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-26 06:02:29,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:29,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948790887] [2020-10-26 06:02:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,974 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-26 06:02:29,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:29,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776703688] [2020-10-26 06:02:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:30,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:30,008 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-26 06:02:30,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:30,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410568501] [2020-10-26 06:02:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:30,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:30,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:30,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:30,272 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-26 06:02:30,341 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:30,341 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:30,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:30,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:30,342 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:30,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:30,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:30,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:30,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2020-10-26 06:02:30,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:30,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:30,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:02:30,377 INFO 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:02:30,381 INFO 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:02:30,386 INFO 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:02:30,521 INFO 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:02:30,525 INFO 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:02:30,528 INFO 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:02:30,532 INFO 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:02:30,536 INFO 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:02:30,540 INFO 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:02:30,794 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:30,799 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:02:30,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:30,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:30,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:30,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:30,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:30,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:30,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:30,820 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:02:30,823 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:02:30,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:30,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:30,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:30,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:30,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:30,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:30,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:30,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:30,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:30,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:30,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:30,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:30,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:30,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:30,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:30,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:30,919 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:02:30,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:30,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:30,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:30,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:30,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:30,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:30,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:30,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:30,956 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:30,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:30,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:30,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:30,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:30,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:31,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:31,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:31,041 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:31,154 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 06:02:31,155 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:31,168 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:31,173 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 06:02:31,173 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:31,174 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -4*ULTIMATE.start_main_~i~1 + 2147483637 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 + 1*ULTIMATE.start_main_~numbers~0.offset + 2147483640 >= 0] [2020-10-26 06:02:31,269 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-26 06:02:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:31,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:02:31,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:31,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:02:31,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:31,406 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:02:31,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 06:02:31,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2020-10-26 06:02:31,520 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 47 states and 74 transitions. Complement of second has 9 states. [2020-10-26 06:02:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 06:02:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 06:02:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-10-26 06:02:31,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-26 06:02:31,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:31,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-26 06:02:31,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:31,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-26 06:02:31,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:31,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2020-10-26 06:02:31,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 06:02:31,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2020-10-26 06:02:31,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 06:02:31,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 06:02:31,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-10-26 06:02:31,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:31,541 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-26 06:02:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-10-26 06:02:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-26 06:02:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-26 06:02:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-10-26 06:02:31,579 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-26 06:02:31,579 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-26 06:02:31,579 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:02:31,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2020-10-26 06:02:31,580 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 06:02:31,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:31,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:31,580 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:02:31,581 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:31,581 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 155#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 156#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 160#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 153#L535-3 assume !(main_~i~1 < main_~array_size~0); 154#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 146#L517-3 [2020-10-26 06:02:31,581 INFO L796 eck$LassoCheckResult]: Loop: 146#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 145#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 146#L517-3 [2020-10-26 06:02:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-26 06:02:31,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:31,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059822943] [2020-10-26 06:02:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:31,652 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:02:31,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059822943] [2020-10-26 06:02:31,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:31,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:02:31,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725203874] [2020-10-26 06:02:31,657 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:31,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-10-26 06:02:31,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:31,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752813847] [2020-10-26 06:02:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,679 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:31,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 06:02:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 06:02:31,757 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-26 06:02:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:31,792 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-10-26 06:02:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:02:31,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2020-10-26 06:02:31,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 06:02:31,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2020-10-26 06:02:31,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 06:02:31,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 06:02:31,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-10-26 06:02:31,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:31,796 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-26 06:02:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-10-26 06:02:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-26 06:02:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-26 06:02:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-10-26 06:02:31,800 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-26 06:02:31,800 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-26 06:02:31,800 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:02:31,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-10-26 06:02:31,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 06:02:31,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:31,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:31,801 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:31,801 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:31,802 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 203#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 204#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 210#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 205#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 201#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 202#L535-3 assume !(main_~i~1 < main_~array_size~0); 206#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 196#L517-3 [2020-10-26 06:02:31,802 INFO L796 eck$LassoCheckResult]: Loop: 196#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 195#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 196#L517-3 [2020-10-26 06:02:31,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-10-26 06:02:31,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:31,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579766456] [2020-10-26 06:02:31,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-10-26 06:02:31,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:31,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603490195] [2020-10-26 06:02:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,901 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-10-26 06:02:31,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:31,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788464094] [2020-10-26 06:02:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:31,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:31,986 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:32,561 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2020-10-26 06:02:32,738 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-26 06:02:32,742 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:32,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:32,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:32,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:32,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:32,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:32,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:32,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2020-10-26 06:02:32,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:32,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:32,750 INFO 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:02:32,765 INFO 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:02:32,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:32,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:32,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:32,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:32,780 INFO 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:02:33,235 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-10-26 06:02:33,371 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-10-26 06:02:33,374 INFO 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:02:33,380 INFO 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:02:33,384 INFO 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:02:33,387 INFO 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:02:33,396 INFO 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:02:33,400 INFO 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:02:33,403 INFO 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:02:33,406 INFO 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:02:33,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:02:33,411 INFO 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:02:33,414 INFO 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:02:33,416 INFO 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:02:33,419 INFO 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:02:33,423 INFO 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:02:33,425 INFO 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:02:33,428 INFO 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:02:33,431 INFO 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:02:33,433 INFO 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:02:33,437 INFO 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:02:33,782 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-10-26 06:02:34,190 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-26 06:02:34,414 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:34,415 INFO L489 LassoAnalysis]: Using template 'affine'. 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:02:34,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:34,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:34,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:34,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:34,429 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:02:34,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:34,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:34,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:34,461 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:02:34,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:34,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:34,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:34,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:34,490 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:02:34,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:02:34,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:34,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:34,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:34,527 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:02:34,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:34,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:34,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:34,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:34,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:34,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:34,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:34,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:34,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:34,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:34,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:34,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:34,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:34,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:34,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:34,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:34,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:34,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:34,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:34,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:34,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:34,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:34,794 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-26 06:02:34,795 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:34,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:34,807 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:34,807 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:34,807 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-10-26 06:02:34,920 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-10-26 06:02:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:34,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:02:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:34,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:34,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:34,987 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:02:34,988 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:02:34,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-26 06:02:35,036 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 7 states. [2020-10-26 06:02:35,038 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:02:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:02:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-26 06:02:35,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2020-10-26 06:02:35,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:35,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-26 06:02:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:35,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-26 06:02:35,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:35,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-10-26 06:02:35,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-26 06:02:35,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-10-26 06:02:35,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 06:02:35,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 06:02:35,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-10-26 06:02:35,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:35,043 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-26 06:02:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-10-26 06:02:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-26 06:02:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 06:02:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-10-26 06:02:35,046 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-26 06:02:35,046 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-26 06:02:35,046 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:02:35,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-10-26 06:02:35,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-26 06:02:35,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:35,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:35,048 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:35,048 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:35,048 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 375#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 376#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 382#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 377#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 373#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 374#L535-3 assume !(main_~i~1 < main_~array_size~0); 378#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 369#L517-3 assume !(lis_~i~0 < lis_~N); 370#L517-4 lis_~i~0 := 1; 363#L519-3 [2020-10-26 06:02:35,048 INFO L796 eck$LassoCheckResult]: Loop: 363#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 365#L520-3 assume !(lis_~j~0 < lis_~i~0); 384#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 363#L519-3 [2020-10-26 06:02:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-10-26 06:02:35,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:35,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875102080] [2020-10-26 06:02:35,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:35,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875102080] [2020-10-26 06:02:35,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:35,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:02:35,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32250207] [2020-10-26 06:02:35,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2020-10-26 06:02:35,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:35,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593885334] [2020-10-26 06:02:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:35,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:35,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:35,109 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:35,129 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:35,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:35,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:35,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:35,129 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 06:02:35,129 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,129 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:35,129 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:35,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-10-26 06:02:35,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:35,130 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:35,131 INFO 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:02:35,135 INFO 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:02:35,139 INFO 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:02:35,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:35,239 INFO L404 LassoAnalysis]: Checking for nontermination... 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:02:35,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 06:02:35,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 06:02:35,251 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 06:02:35,251 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:02:35,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 06:02:35,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 06:02:35,279 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 06:02:35,279 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 06:02:35,303 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:02:35,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 06:02:35,373 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,591 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 06:02:35,593 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:35,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:35,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:35,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:35,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:35,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:35,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:35,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-10-26 06:02:35,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:35,594 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:35,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,699 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:35,699 INFO L489 LassoAnalysis]: Using template 'affine'. 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:02:35,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:02:35,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:35,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:35,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:35,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:35,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:35,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:35,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02:35,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:35,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:35,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:35,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:35,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:35,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:35,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:35,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:35,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:35,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:35,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:35,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:35,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:35,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:35,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:35,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:35,792 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-26 06:02:35,792 INFO L444 ModelExtractionUtils]: 1 out of 5 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:02:35,796 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 06:02:35,796 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:35,796 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-10-26 06:02:35,816 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 06:02:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:35,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:02:35,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:35,888 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:35,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:35,900 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:02:35,900 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:02:35,900 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-26 06:02:35,957 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 46 transitions. Complement of second has 7 states. [2020-10-26 06:02:35,957 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:02:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:02:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-10-26 06:02:35,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-26 06:02:35,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:35,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 3 letters. [2020-10-26 06:02:35,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:35,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-26 06:02:35,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:35,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2020-10-26 06:02:35,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:35,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 42 transitions. [2020-10-26 06:02:35,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-26 06:02:35,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 06:02:35,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-10-26 06:02:35,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:35,962 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-10-26 06:02:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-10-26 06:02:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-26 06:02:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 06:02:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-10-26 06:02:35,965 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-10-26 06:02:35,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 06:02:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 06:02:35,966 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-10-26 06:02:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:36,040 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-10-26 06:02:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:02:36,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-10-26 06:02:36,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:36,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 41 transitions. [2020-10-26 06:02:36,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 06:02:36,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 06:02:36,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2020-10-26 06:02:36,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:36,043 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-10-26 06:02:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2020-10-26 06:02:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-26 06:02:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 06:02:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-10-26 06:02:36,046 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-26 06:02:36,046 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-26 06:02:36,046 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:02:36,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-10-26 06:02:36,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:36,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:36,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:36,048 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:36,048 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:02:36,048 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 549#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 550#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 558#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 551#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 547#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 548#L535-3 assume !(main_~i~1 < main_~array_size~0); 552#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 543#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 540#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 541#L517-3 assume !(lis_~i~0 < lis_~N); 544#L517-4 lis_~i~0 := 1; 535#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 538#L520-3 [2020-10-26 06:02:36,048 INFO L796 eck$LassoCheckResult]: Loop: 538#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 553#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 554#L521-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11; 559#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 538#L520-3 [2020-10-26 06:02:36,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:36,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2020-10-26 06:02:36,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:36,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047098689] [2020-10-26 06:02:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:36,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047098689] [2020-10-26 06:02:36,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604832093] [2020-10-26 06:02:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:36,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 06:02:36,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:36,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:02:36,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2020-10-26 06:02:36,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086133178] [2020-10-26 06:02:36,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:36,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2020-10-26 06:02:36,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:36,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335747159] [2020-10-26 06:02:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:36,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:36,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:36,263 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:36,406 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-26 06:02:36,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 06:02:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-26 06:02:36,449 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 18 Second operand 10 states. [2020-10-26 06:02:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:36,795 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2020-10-26 06:02:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-26 06:02:36,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 94 transitions. [2020-10-26 06:02:36,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 06:02:36,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 66 transitions. [2020-10-26 06:02:36,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-26 06:02:36,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-26 06:02:36,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2020-10-26 06:02:36,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:36,800 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2020-10-26 06:02:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2020-10-26 06:02:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-10-26 06:02:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 06:02:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-26 06:02:36,808 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-26 06:02:36,808 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-26 06:02:36,808 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:02:36,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-26 06:02:36,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:36,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:36,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:36,809 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:36,809 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:02:36,810 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 710#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 711#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 720#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 712#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 708#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 709#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 713#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 724#L535-3 assume !(main_~i~1 < main_~array_size~0); 719#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 702#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 703#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 704#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 699#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 700#L517-3 assume !(lis_~i~0 < lis_~N); 707#L517-4 lis_~i~0 := 1; 694#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 696#L520-3 [2020-10-26 06:02:36,810 INFO L796 eck$LassoCheckResult]: Loop: 696#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 714#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 715#L521-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11; 721#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 696#L520-3 [2020-10-26 06:02:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:36,810 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2020-10-26 06:02:36,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:36,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521016106] [2020-10-26 06:02:36,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:36,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:36,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:36,941 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2020-10-26 06:02:36,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:36,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134508285] [2020-10-26 06:02:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:36,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:36,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:36,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:36,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2020-10-26 06:02:36,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:36,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762695609] [2020-10-26 06:02:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:37,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762695609] [2020-10-26 06:02:37,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063825651] [2020-10-26 06:02:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:37,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-26 06:02:37,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:37,445 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-10-26 06:02:37,448 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:37,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:37,452 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 06:02:37,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-10-26 06:02:37,534 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:37,535 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-10-26 06:02:37,536 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:37,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:37,550 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:37,550 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:8 [2020-10-26 06:02:37,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-10-26 06:02:37,579 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:37,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:37,589 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:37,590 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-10-26 06:02:37,714 INFO L350 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2020-10-26 06:02:37,714 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 41 [2020-10-26 06:02:37,716 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:37,731 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:37,735 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 06:02:37,735 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2020-10-26 06:02:37,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 06:02:37,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 06:02:37,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 06:02:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 06:02:38,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:02:38,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-26 06:02:38,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809171990] [2020-10-26 06:02:38,227 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-26 06:02:38,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-26 06:02:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-26 06:02:38,267 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 17 states. [2020-10-26 06:02:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:39,109 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2020-10-26 06:02:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 06:02:39,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2020-10-26 06:02:39,114 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2020-10-26 06:02:39,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 98 transitions. [2020-10-26 06:02:39,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-26 06:02:39,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-26 06:02:39,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2020-10-26 06:02:39,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:39,118 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 98 transitions. [2020-10-26 06:02:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2020-10-26 06:02:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-10-26 06:02:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 06:02:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2020-10-26 06:02:39,132 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-10-26 06:02:39,132 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-10-26 06:02:39,132 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 06:02:39,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 56 transitions. [2020-10-26 06:02:39,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:39,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:39,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:39,134 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:39,135 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:02:39,135 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 911#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 912#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 922#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 913#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 909#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 910#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 914#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 928#L535-3 assume !(main_~i~1 < main_~array_size~0); 921#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 902#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 903#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 904#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 899#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 900#L517-3 assume !(lis_~i~0 < lis_~N); 907#L517-4 lis_~i~0 := 1; 908#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 933#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 934#L521 assume !lis_#t~short11; 916#L521-2 [2020-10-26 06:02:39,135 INFO L796 eck$LassoCheckResult]: Loop: 916#L521-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11; 924#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 896#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 915#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 916#L521-2 [2020-10-26 06:02:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1570854005, now seen corresponding path program 1 times [2020-10-26 06:02:39,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:39,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575933904] [2020-10-26 06:02:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:39,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:39,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:39,250 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 3 times [2020-10-26 06:02:39,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:39,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019039669] [2020-10-26 06:02:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:39,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:39,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:39,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1264986138, now seen corresponding path program 1 times [2020-10-26 06:02:39,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:39,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156832065] [2020-10-26 06:02:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-26 06:02:39,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156832065] [2020-10-26 06:02:39,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828066421] [2020-10-26 06:02:39,324 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:02:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:39,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:39,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-26 06:02:39,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-26 06:02:39,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-10-26 06:02:39,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575141768] [2020-10-26 06:02:39,628 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-10-26 06:02:39,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:02:39,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-26 06:02:39,720 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-10-26 06:02:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:39,800 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-10-26 06:02:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:02:39,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2020-10-26 06:02:39,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:39,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 48 states and 64 transitions. [2020-10-26 06:02:39,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 06:02:39,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-26 06:02:39,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-10-26 06:02:39,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:39,807 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-10-26 06:02:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-10-26 06:02:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2020-10-26 06:02:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-26 06:02:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-26 06:02:39,816 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-26 06:02:39,817 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-26 06:02:39,817 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 06:02:39,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2020-10-26 06:02:39,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:39,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:39,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:39,820 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:39,821 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:02:39,821 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1087#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1088#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1098#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1089#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1085#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1086#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1090#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1104#L535-3 assume !(main_~i~1 < main_~array_size~0); 1097#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1079#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1076#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1077#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1080#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1105#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1106#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1110#L517-3 assume !(lis_~i~0 < lis_~N); 1109#L517-4 lis_~i~0 := 1; 1070#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1071#L520-3 assume !(lis_~j~0 < lis_~i~0); 1103#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1072#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1074#L520-3 [2020-10-26 06:02:39,821 INFO L796 eck$LassoCheckResult]: Loop: 1074#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1091#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1092#L521-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11; 1099#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1074#L520-3 [2020-10-26 06:02:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:39,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1189567124, now seen corresponding path program 1 times [2020-10-26 06:02:39,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:39,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34602434] [2020-10-26 06:02:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-26 06:02:39,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34602434] [2020-10-26 06:02:39,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:39,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:02:39,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602189959] [2020-10-26 06:02:39,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 4 times [2020-10-26 06:02:39,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:39,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684990335] [2020-10-26 06:02:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:39,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:39,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:39,909 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,047 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-26 06:02:40,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 06:02:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 06:02:40,090 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-10-26 06:02:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:40,145 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-10-26 06:02:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:02:40,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2020-10-26 06:02:40,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:40,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 58 transitions. [2020-10-26 06:02:40,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 06:02:40,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 06:02:40,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 58 transitions. [2020-10-26 06:02:40,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:40,150 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-10-26 06:02:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 58 transitions. [2020-10-26 06:02:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-10-26 06:02:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-26 06:02:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-10-26 06:02:40,161 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-26 06:02:40,162 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-26 06:02:40,162 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 06:02:40,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-10-26 06:02:40,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:40,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:40,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:40,164 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:40,164 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:02:40,165 INFO L794 eck$LassoCheckResult]: Stem: 1189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1180#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1181#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1191#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1182#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1178#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1179#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1183#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1197#L535-3 assume !(main_~i~1 < main_~array_size~0); 1190#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1173#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1174#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1206#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1205#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1204#L517-3 assume !(lis_~i~0 < lis_~N); 1203#L517-4 lis_~i~0 := 1; 1200#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1195#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1186#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1187#L521-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1193#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1194#L520-3 assume !(lis_~j~0 < lis_~i~0); 1196#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1166#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1168#L520-3 [2020-10-26 06:02:40,165 INFO L796 eck$LassoCheckResult]: Loop: 1168#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1184#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1185#L521-2 assume !lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11; 1192#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L520-3 [2020-10-26 06:02:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 500757827, now seen corresponding path program 1 times [2020-10-26 06:02:40,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93442933] [2020-10-26 06:02:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 06:02:40,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93442933] [2020-10-26 06:02:40,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851718079] [2020-10-26 06:02:40,276 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:02:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:40,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 06:02:40,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 06:02:40,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:02:40,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-10-26 06:02:40,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477588801] [2020-10-26 06:02:40,445 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 5 times [2020-10-26 06:02:40,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89868935] [2020-10-26 06:02:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,586 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-26 06:02:40,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 06:02:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-26 06:02:40,625 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 19 Second operand 12 states. [2020-10-26 06:02:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:40,838 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2020-10-26 06:02:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 06:02:40,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 93 transitions. [2020-10-26 06:02:40,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:02:40,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 93 transitions. [2020-10-26 06:02:40,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-26 06:02:40,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-26 06:02:40,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2020-10-26 06:02:40,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:40,843 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2020-10-26 06:02:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2020-10-26 06:02:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2020-10-26 06:02:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-26 06:02:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2020-10-26 06:02:40,848 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-10-26 06:02:40,848 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-10-26 06:02:40,848 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 06:02:40,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 87 transitions. [2020-10-26 06:02:40,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 06:02:40,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:40,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:40,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:40,851 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:40,851 INFO L794 eck$LassoCheckResult]: Stem: 1400#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1390#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1391#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1401#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1392#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1393#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1430#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1429#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1428#L535-3 assume !(main_~i~1 < main_~array_size~0); 1427#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1426#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1425#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1424#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1423#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1422#L517-3 assume !(lis_~i~0 < lis_~N); 1419#L517-4 lis_~i~0 := 1; 1417#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1415#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1413#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1411#L521-2 assume lis_#t~short11;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1409#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1408#L520-3 assume !(lis_~j~0 < lis_~i~0); 1405#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1406#L519-3 assume !(lis_~i~0 < lis_~N); 1376#L519-4 lis_~i~0 := 0; 1381#L523-3 [2020-10-26 06:02:40,851 INFO L796 eck$LassoCheckResult]: Loop: 1381#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1384#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1385#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1381#L523-3 [2020-10-26 06:02:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2020-10-26 06:02:40,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38609144] [2020-10-26 06:02:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2020-10-26 06:02:40,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205745054] [2020-10-26 06:02:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2020-10-26 06:02:40,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950537885] [2020-10-26 06:02:40,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,995 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:46,961 WARN L193 SmtUtils]: Spent 5.90 s on a formula simplification. DAG size of input: 276 DAG size of output: 192 [2020-10-26 06:02:49,173 WARN L193 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 148 [2020-10-26 06:02:49,176 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:49,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:49,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:49,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:49,177 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:49,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:49,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:49,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:49,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2020-10-26 06:02:49,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:49,177 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:49,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,200 INFO 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:02:49,204 INFO 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:02:49,208 INFO 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:02:49,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,216 INFO 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:02:49,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,227 INFO 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:02:49,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,246 INFO 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:02:49,249 INFO 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:02:49,252 INFO 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:02:49,255 INFO 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:02:49,259 INFO 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:02:49,263 INFO 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:02:49,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,274 INFO 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:02:49,277 INFO 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:02:49,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:49,282 INFO 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:02:49,286 INFO 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:02:49,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:50,813 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:02:50,822 INFO L168 Benchmark]: Toolchain (without parser) took 22529.84 ms. Allocated memory was 44.0 MB in the beginning and 174.1 MB in the end (delta: 130.0 MB). Free memory was 28.7 MB in the beginning and 85.6 MB in the end (delta: -56.9 MB). Peak memory consumption was 107.3 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:50,823 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 35.7 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:02:50,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.10 ms. Allocated memory is still 44.0 MB. Free memory was 28.0 MB in the beginning and 24.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:50,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.93 ms. Allocated memory is still 44.0 MB. Free memory was 24.2 MB in the beginning and 22.1 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:02:50,827 INFO L168 Benchmark]: Boogie Preprocessor took 35.14 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 20.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:02:50,831 INFO L168 Benchmark]: RCFGBuilder took 690.68 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.7 MB in the beginning and 35.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:50,833 INFO L168 Benchmark]: BuchiAutomizer took 21141.24 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 34.9 MB in the beginning and 85.6 MB in the end (delta: -50.7 MB). Peak memory consumption was 104.8 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:50,839 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.34 ms. Allocated memory is still 35.7 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 587.10 ms. Allocated memory is still 44.0 MB. Free memory was 28.0 MB in the beginning and 24.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.93 ms. Allocated memory is still 44.0 MB. Free memory was 24.2 MB in the beginning and 22.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.14 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 20.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 690.68 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.7 MB in the beginning and 35.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 21141.24 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 34.9 MB in the beginning and 85.6 MB in the end (delta: -50.7 MB). Peak memory consumption was 104.8 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...