./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-acceleration/array_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/loop-acceleration/array_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 866342b97e5be917007cb97e07a0644c7c9d2aa9b428c32cf026d727d672a191 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:59:15,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:59:15,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:59:15,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:59:15,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:59:15,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:59:15,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:59:15,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:59:15,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:59:15,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:59:15,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:59:15,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:59:15,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:59:15,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:59:15,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:59:15,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:59:15,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:59:15,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:59:15,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:59:15,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:59:15,611 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:59:15,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:59:15,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:59:15,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:59:15,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:59:15,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:59:15,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:59:15,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:59:15,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:59:15,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:59:15,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:59:15,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:59:15,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:59:15,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:59:15,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:59:15,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:59:15,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:59:15,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:59:15,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:59:15,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:59:15,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:59:15,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:59:15,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:59:15,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:59:15,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:59:15,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:59:15,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:59:15,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:59:15,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:59:15,672 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:59:15,672 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:59:15,672 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:59:15,673 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:59:15,673 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:59:15,673 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:59:15,673 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:59:15,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:59:15,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:59:15,674 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:59:15,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:59:15,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:59:15,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:59:15,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:59:15,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:59:15,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:59:15,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:59:15,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:59:15,676 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:59:15,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:59:15,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:59:15,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:59:15,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:59:15,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:59:15,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:59:15,689 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:59:15,689 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 -> 866342b97e5be917007cb97e07a0644c7c9d2aa9b428c32cf026d727d672a191 [2022-07-13 03:59:15,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:59:15,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:59:15,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:59:15,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:59:15,927 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:59:15,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_2-2.i [2022-07-13 03:59:15,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e25d2af3/835f3ec6e986410db9ccf934149f3a9a/FLAG2e80f88e6 [2022-07-13 03:59:16,366 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:59:16,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-2.i [2022-07-13 03:59:16,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e25d2af3/835f3ec6e986410db9ccf934149f3a9a/FLAG2e80f88e6 [2022-07-13 03:59:16,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e25d2af3/835f3ec6e986410db9ccf934149f3a9a [2022-07-13 03:59:16,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:59:16,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:59:16,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:59:16,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:59:16,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:59:16,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:59:16" (1/1) ... [2022-07-13 03:59:16,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40779b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:16, skipping insertion in model container [2022-07-13 03:59:16,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:59:16" (1/1) ... [2022-07-13 03:59:16,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:59:16,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:59:16,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-2.i[849,862] [2022-07-13 03:59:16,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:59:16,980 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:59:16,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-2.i[849,862] [2022-07-13 03:59:17,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:59:17,024 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:59:17,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17 WrapperNode [2022-07-13 03:59:17,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:59:17,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:59:17,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:59:17,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:59:17,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,057 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2022-07-13 03:59:17,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:59:17,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:59:17,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:59:17,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:59:17,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:59:17,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:59:17,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:59:17,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:59:17,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (1/1) ... [2022-07-13 03:59:17,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:17,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:17,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:59:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:59:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:59:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:59:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:59:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:59:17,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:59:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:59:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:59:17,204 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:59:17,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:59:17,296 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:59:17,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:59:17,302 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:59:17,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:59:17 BoogieIcfgContainer [2022-07-13 03:59:17,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:59:17,304 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:59:17,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:59:17,307 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:59:17,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:59:17,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:59:16" (1/3) ... [2022-07-13 03:59:17,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5633f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:59:17, skipping insertion in model container [2022-07-13 03:59:17,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:59:17,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:59:17" (2/3) ... [2022-07-13 03:59:17,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5633f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:59:17, skipping insertion in model container [2022-07-13 03:59:17,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:59:17,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:59:17" (3/3) ... [2022-07-13 03:59:17,311 INFO L354 chiAutomizerObserver]: Analyzing ICFG array_2-2.i [2022-07-13 03:59:17,356 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:59:17,356 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:59:17,356 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:59:17,357 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:59:17,357 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:59:17,357 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:59:17,357 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:59:17,357 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:59:17,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:17,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 03:59:17,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:17,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:17,377 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:59:17,377 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:17,377 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:59:17,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:17,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 03:59:17,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:17,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:17,380 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:59:17,380 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:17,387 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 6#L25-3true [2022-07-13 03:59:17,389 INFO L754 eck$LassoCheckResult]: Loop: 6#L25-3true assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10#L25-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6#L25-3true [2022-07-13 03:59:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:59:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:17,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582534077] [2022-07-13 03:59:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:17,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:17,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-13 03:59:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:17,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082612855] [2022-07-13 03:59:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:17,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:17,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-13 03:59:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:17,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133616199] [2022-07-13 03:59:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:17,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:17,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:18,136 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:59:18,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:59:18,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:59:18,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:59:18,138 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:59:18,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:18,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:59:18,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:59:18,139 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_2-2.i_Iteration1_Lasso [2022-07-13 03:59:18,139 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:59:18,139 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:59:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:59:18,725 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:59:18,728 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:59:18,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:18,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:18,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:59:18,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:18,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:18,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:18,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:18,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:18,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:18,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:18,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:18,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:18,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:18,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:18,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:18,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:18,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:59:18,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:18,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:18,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:18,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:18,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:18,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:59:18,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:59:18,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:18,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:18,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:18,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:18,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:18,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:59:18,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:18,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:18,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:18,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:18,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:18,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:18,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:18,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:18,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:18,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-13 03:59:18,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:18,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:18,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:18,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:59:18,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:18,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:18,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:18,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:18,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:18,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:18,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:18,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:18,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:18,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-13 03:59:18,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:18,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:18,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:18,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:59:18,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:18,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:18,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:18,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:18,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:18,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:59:18,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:59:18,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:19,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:59:19,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:19,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:19,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:19,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-13 03:59:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 03:59:19,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:19,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:19,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:19,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:19,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,066 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 03:59:19,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:19,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:19,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:19,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-13 03:59:19,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 03:59:19,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:19,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:19,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:19,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-13 03:59:19,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,121 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 03:59:19,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:59:19,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:59:19,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:19,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 03:59:19,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:59:19,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:59:19,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:59:19,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,216 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:59:19,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:59:19,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:59:19,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:59:19,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:19,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,280 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:59:19,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:59:19,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:59:19,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:59:19,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:59:19,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:59:19,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:59:19,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:59:19,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:59:19,371 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2022-07-13 03:59:19,371 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-13 03:59:19,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:59:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,391 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:59:19,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:59:19,431 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:59:19,431 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:59:19,432 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#B~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 4095*v_rep(select #length ULTIMATE.start_main_~#B~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-13 03:59:19,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-13 03:59:19,493 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-13 03:59:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:19,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:59:19,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:59:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:19,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:59:19,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:59:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:19,603 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 [2022-07-13 03:59:19,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:19,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 37 transitions. Complement of second has 8 states. [2022-07-13 03:59:19,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:59:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-07-13 03:59:19,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 03:59:19,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:59:19,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:59:19,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:59:19,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 03:59:19,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:59:19,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2022-07-13 03:59:19,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:19,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 8 states and 10 transitions. [2022-07-13 03:59:19,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-13 03:59:19,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:59:19,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-07-13 03:59:19,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:59:19,647 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-13 03:59:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-07-13 03:59:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-13 03:59:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-07-13 03:59:19,666 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-13 03:59:19,666 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-13 03:59:19,666 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:59:19,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-07-13 03:59:19,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:19,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:19,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:19,668 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:59:19,668 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:19,668 INFO L752 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 132#L25-3 assume !(main_~i~0#1 < 2048); 131#L25-4 main_~i~0#1 := 0; 129#L29-3 [2022-07-13 03:59:19,668 INFO L754 eck$LassoCheckResult]: Loop: 129#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 130#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129#L29-3 [2022-07-13 03:59:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-13 03:59:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:19,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859995916] [2022-07-13 03:59:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:59:19,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859995916] [2022-07-13 03:59:19,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859995916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:59:19,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:59:19,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:59:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101439277] [2022-07-13 03:59:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:59:19,704 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:59:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2022-07-13 03:59:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:19,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109368283] [2022-07-13 03:59:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:19,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:19,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:59:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:59:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:59:19,783 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:59:19,797 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-07-13 03:59:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:59:19,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-07-13 03:59:19,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:19,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-07-13 03:59:19,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 03:59:19,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 03:59:19,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-07-13 03:59:19,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:59:19,802 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-13 03:59:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-07-13 03:59:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2022-07-13 03:59:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-13 03:59:19,804 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-13 03:59:19,804 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-13 03:59:19,805 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:59:19,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-07-13 03:59:19,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:19,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:19,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:19,808 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:59:19,808 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:19,808 INFO L752 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 157#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 150#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 151#L25-3 assume !(main_~i~0#1 < 2048); 156#L25-4 main_~i~0#1 := 0; 152#L29-3 [2022-07-13 03:59:19,808 INFO L754 eck$LassoCheckResult]: Loop: 152#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 153#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 152#L29-3 [2022-07-13 03:59:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-13 03:59:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692701585] [2022-07-13 03:59:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:59:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692701585] [2022-07-13 03:59:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692701585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:59:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271195905] [2022-07-13 03:59:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:59:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:19,860 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:59:19,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 03:59:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:19,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:59:19,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:59:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:19,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:59:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271195905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:59:19,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:59:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 03:59:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618848813] [2022-07-13 03:59:19,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:59:19,955 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:59:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2022-07-13 03:59:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:19,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478754984] [2022-07-13 03:59:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:19,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:19,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:59:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:59:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:59:20,034 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:59:20,074 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-07-13 03:59:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:59:20,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2022-07-13 03:59:20,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:20,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2022-07-13 03:59:20,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:59:20,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:59:20,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2022-07-13 03:59:20,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:59:20,076 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-13 03:59:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2022-07-13 03:59:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2022-07-13 03:59:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-13 03:59:20,078 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-13 03:59:20,078 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-13 03:59:20,078 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:59:20,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-07-13 03:59:20,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:20,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:20,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:20,079 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-13 03:59:20,079 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:20,079 INFO L752 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 225#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 219#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 220#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 226#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 232#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 231#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 230#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 229#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 228#L25-3 assume !(main_~i~0#1 < 2048); 227#L25-4 main_~i~0#1 := 0; 223#L29-3 [2022-07-13 03:59:20,080 INFO L754 eck$LassoCheckResult]: Loop: 223#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 224#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 223#L29-3 [2022-07-13 03:59:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-13 03:59:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:20,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577002980] [2022-07-13 03:59:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:20,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 03:59:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:59:20,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577002980] [2022-07-13 03:59:20,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577002980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:59:20,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020065119] [2022-07-13 03:59:20,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:59:20,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:59:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:20,176 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:59:20,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 03:59:20,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:59:20,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:59:20,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:59:20,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:59:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:20,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:59:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:20,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020065119] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:59:20,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:59:20,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-13 03:59:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900413274] [2022-07-13 03:59:20,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:59:20,316 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:59:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2022-07-13 03:59:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:20,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396530670] [2022-07-13 03:59:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:20,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:20,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:59:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:59:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:59:20,379 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:59:20,451 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-07-13 03:59:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:59:20,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2022-07-13 03:59:20,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:20,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2022-07-13 03:59:20,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-13 03:59:20,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-13 03:59:20,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2022-07-13 03:59:20,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:59:20,454 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-07-13 03:59:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2022-07-13 03:59:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2022-07-13 03:59:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-13 03:59:20,457 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-13 03:59:20,457 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-13 03:59:20,457 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:59:20,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2022-07-13 03:59:20,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:20,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:20,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:20,458 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-07-13 03:59:20,458 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:20,458 INFO L752 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 366#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 367#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 368#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 360#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 361#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 385#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 384#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 383#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 382#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 381#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 380#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 379#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 378#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 377#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 376#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 375#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 374#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 373#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 372#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 371#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 370#L25-3 assume !(main_~i~0#1 < 2048); 369#L25-4 main_~i~0#1 := 0; 362#L29-3 [2022-07-13 03:59:20,458 INFO L754 eck$LassoCheckResult]: Loop: 362#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 363#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 362#L29-3 [2022-07-13 03:59:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2022-07-13 03:59:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:20,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023442527] [2022-07-13 03:59:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:59:20,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023442527] [2022-07-13 03:59:20,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023442527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:59:20,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062611829] [2022-07-13 03:59:20,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:59:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:59:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:20,597 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:59:20,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 03:59:21,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 03:59:21,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:59:21,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:59:21,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:59:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:21,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:59:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:21,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062611829] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:59:21,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:59:21,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-13 03:59:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073486019] [2022-07-13 03:59:21,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:59:21,350 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:59:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2022-07-13 03:59:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312529854] [2022-07-13 03:59:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:21,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:21,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:21,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:59:21,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 03:59:21,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-13 03:59:21,410 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:59:21,568 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-07-13 03:59:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 03:59:21,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions. [2022-07-13 03:59:21,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:21,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 94 transitions. [2022-07-13 03:59:21,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2022-07-13 03:59:21,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2022-07-13 03:59:21,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions. [2022-07-13 03:59:21,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:59:21,582 INFO L369 hiAutomatonCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-07-13 03:59:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions. [2022-07-13 03:59:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50. [2022-07-13 03:59:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-07-13 03:59:21,589 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-13 03:59:21,589 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-13 03:59:21,589 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:59:21,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2022-07-13 03:59:21,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:21,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:21,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:21,592 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2022-07-13 03:59:21,592 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:21,592 INFO L752 eck$LassoCheckResult]: Stem: 649#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 651#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 652#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 653#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 645#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 646#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 694#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 693#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 692#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 691#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 690#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 689#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 688#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 687#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 686#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 685#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 684#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 683#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 682#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 681#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 680#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 679#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 678#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 677#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 676#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 675#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 674#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 673#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 672#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 671#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 670#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 669#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 668#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 667#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 666#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 665#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 664#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 663#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 662#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 661#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 660#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 659#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 658#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 657#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 656#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 655#L25-3 assume !(main_~i~0#1 < 2048); 654#L25-4 main_~i~0#1 := 0; 647#L29-3 [2022-07-13 03:59:21,594 INFO L754 eck$LassoCheckResult]: Loop: 647#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 648#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 647#L29-3 [2022-07-13 03:59:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2022-07-13 03:59:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:21,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503945543] [2022-07-13 03:59:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:59:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503945543] [2022-07-13 03:59:22,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503945543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:59:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565991533] [2022-07-13 03:59:22,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 03:59:22,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:59:22,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:22,031 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:59:22,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 03:59:22,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 03:59:22,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:59:22,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 03:59:22,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:59:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:22,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:59:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565991533] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:59:22,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:59:22,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-13 03:59:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728737953] [2022-07-13 03:59:22,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:59:22,934 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:59:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2022-07-13 03:59:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239381534] [2022-07-13 03:59:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:22,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:59:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:59:22,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:59:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:59:23,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 03:59:23,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 03:59:23,006 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:59:23,379 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2022-07-13 03:59:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 03:59:23,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 190 transitions. [2022-07-13 03:59:23,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:23,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 190 transitions. [2022-07-13 03:59:23,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-07-13 03:59:23,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2022-07-13 03:59:23,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 190 transitions. [2022-07-13 03:59:23,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:59:23,385 INFO L369 hiAutomatonCegarLoop]: Abstraction has 189 states and 190 transitions. [2022-07-13 03:59:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 190 transitions. [2022-07-13 03:59:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2022-07-13 03:59:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:59:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-13 03:59:23,390 INFO L392 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-13 03:59:23,390 INFO L374 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-13 03:59:23,390 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:59:23,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2022-07-13 03:59:23,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:59:23,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:59:23,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:59:23,394 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2022-07-13 03:59:23,394 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:59:23,394 INFO L752 eck$LassoCheckResult]: Stem: 1220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 1221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 1224#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1218#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1219#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1225#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1315#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1314#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1313#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1312#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1311#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1310#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1309#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1308#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1307#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1306#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1305#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1304#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1303#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1302#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1301#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1300#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1299#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1298#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1297#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1296#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1295#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1294#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1293#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1292#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1291#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1290#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1289#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1288#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1287#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1286#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1285#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1284#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1283#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1282#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1281#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1280#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1279#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1278#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1277#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1276#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1275#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1274#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1273#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1272#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1271#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1270#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1269#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1268#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1267#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1266#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1265#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1264#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1263#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1262#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1261#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1260#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1259#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1258#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1257#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1256#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1255#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1254#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1253#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1252#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1251#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1250#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1249#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1248#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1247#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1246#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1245#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1244#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1243#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1242#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1241#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1240#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1239#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1238#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1237#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1236#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1235#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1234#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1233#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1232#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1231#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1230#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1229#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1228#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1227#L25-3 assume !(main_~i~0#1 < 2048); 1226#L25-4 main_~i~0#1 := 0; 1222#L29-3 [2022-07-13 03:59:23,394 INFO L754 eck$LassoCheckResult]: Loop: 1222#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 1223#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1222#L29-3 [2022-07-13 03:59:23,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:59:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2022-07-13 03:59:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:59:23,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927783571] [2022-07-13 03:59:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:59:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:59:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:59:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:59:24,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:59:24,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927783571] [2022-07-13 03:59:24,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927783571] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:59:24,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313556057] [2022-07-13 03:59:24,363 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:59:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:59:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:59:24,364 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:59:24,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process