./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 574ddb4e 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/termination-crafted/Arrays01-EquivalentConstantIndices-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:38:28,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:38:28,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:38:28,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:38:28,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:38:28,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:38:28,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:38:28,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:38:28,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:38:28,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:38:28,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:38:28,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:38:28,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:38:28,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:38:28,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:38:28,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:38:28,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:38:28,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:38:28,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:38:28,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:38:28,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:38:28,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:38:28,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:38:28,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:38:28,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:38:28,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:38:28,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:38:28,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:38:28,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:38:28,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:38:28,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:38:28,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:38:28,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:38:28,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:38:28,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:38:28,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:38:28,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:38:28,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:38:28,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:38:28,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:38:28,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:38:28,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-17 09:38:28,548 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:38:28,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:38:28,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:38:28,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:38:28,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:38:28,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:38:28,549 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:38:28,549 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-17 09:38:28,549 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-17 09:38:28,550 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-17 09:38:28,550 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-17 09:38:28,550 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-17 09:38:28,550 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-17 09:38:28,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:38:28,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:38:28,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:38:28,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-17 09:38:28,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:38:28,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:38:28,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:38:28,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:38:28,553 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-17 09:38:28,553 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf [2023-02-17 09:38:28,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:38:28,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:38:28,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:38:28,772 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:38:28,773 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:38:28,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2023-02-17 09:38:29,785 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:38:29,956 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:38:29,956 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2023-02-17 09:38:29,960 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4e89da2/ef33529655894a3f8c65d45c0d7d97d9/FLAGf81ea78d8 [2023-02-17 09:38:29,972 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4e89da2/ef33529655894a3f8c65d45c0d7d97d9 [2023-02-17 09:38:29,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:38:29,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:38:29,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:38:29,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:38:29,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:38:29,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:38:29" (1/1) ... [2023-02-17 09:38:29,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344f1b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:29, skipping insertion in model container [2023-02-17 09:38:29,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:38:29" (1/1) ... [2023-02-17 09:38:29,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:38:29,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:38:30,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:38:30,097 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:38:30,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:38:30,128 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:38:30,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30 WrapperNode [2023-02-17 09:38:30,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:38:30,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:38:30,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:38:30,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:38:30,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,158 INFO L138 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-17 09:38:30,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:38:30,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:38:30,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:38:30,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:38:30,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,181 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:38:30,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:38:30,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:38:30,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:38:30,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (1/1) ... [2023-02-17 09:38:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:30,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:30,212 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) [2023-02-17 09:38:30,217 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 [2023-02-17 09:38:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 09:38:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:38:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:38:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 09:38:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 09:38:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 09:38:30,282 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:38:30,297 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:38:30,422 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:38:30,426 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:38:30,426 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 09:38:30,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:38:30 BoogieIcfgContainer [2023-02-17 09:38:30,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:38:30,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-17 09:38:30,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-17 09:38:30,431 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-17 09:38:30,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:38:30,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.02 09:38:29" (1/3) ... [2023-02-17 09:38:30,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a063fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:38:30, skipping insertion in model container [2023-02-17 09:38:30,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:38:30,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:38:30" (2/3) ... [2023-02-17 09:38:30,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a063fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:38:30, skipping insertion in model container [2023-02-17 09:38:30,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:38:30,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:38:30" (3/3) ... [2023-02-17 09:38:30,434 INFO L332 chiAutomizerObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2023-02-17 09:38:30,487 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-17 09:38:30,488 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-17 09:38:30,488 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-17 09:38:30,488 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-17 09:38:30,488 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-17 09:38:30,488 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-17 09:38:30,488 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-17 09:38:30,488 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-17 09:38:30,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) [2023-02-17 09:38:30,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:38:30,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:30,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:30,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:38:30,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:30,535 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-17 09:38:30,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) [2023-02-17 09:38:30,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:38:30,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:30,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:30,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:38:30,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:30,542 INFO L748 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 8#L13-3true [2023-02-17 09:38:30,544 INFO L750 eck$LassoCheckResult]: Loop: 8#L13-3true assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 6#L13-2true main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 8#L13-3true [2023-02-17 09:38:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-17 09:38:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:30,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453926228] [2023-02-17 09:38:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:30,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:30,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-02-17 09:38:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:30,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944178596] [2023-02-17 09:38:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:30,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:30,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:30,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-17 09:38:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950555372] [2023-02-17 09:38:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:30,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:30,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:30,813 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:38:30,814 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:38:30,814 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:38:30,814 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:38:30,814 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:38:30,814 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:30,814 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:38:30,814 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:38:30,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: Arrays01-EquivalentConstantIndices-1.c_Iteration1_Lasso [2023-02-17 09:38:30,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:38:30,815 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:38:30,830 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,837 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,894 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,896 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:38:30,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:38:30,920 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:38:30,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:30,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:30,924 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) [2023-02-17 09:38:30,929 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 [2023-02-17 09:38:30,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:30,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:38:30,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:30,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:30,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:38:30,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:38:30,947 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 [2023-02-17 09:38:30,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:38:30,963 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 [2023-02-17 09:38:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:30,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:30,965 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) [2023-02-17 09:38:30,966 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 [2023-02-17 09:38:30,968 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 [2023-02-17 09:38:30,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:30,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:38:30,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:38:30,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:30,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:30,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:38:30,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:38:30,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:38:30,986 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 [2023-02-17 09:38:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:30,988 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) [2023-02-17 09:38:30,989 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 [2023-02-17 09:38:30,991 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 [2023-02-17 09:38:30,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:30,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:38:30,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:30,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:31,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:38:31,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:38:31,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:38:31,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-17 09:38:31,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,021 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) [2023-02-17 09:38:31,033 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 [2023-02-17 09:38:31,040 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 [2023-02-17 09:38:31,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:31,041 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-02-17 09:38:31,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:31,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:31,049 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-02-17 09:38:31,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:38:31,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:38:31,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-17 09:38:31,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:31,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,077 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) [2023-02-17 09:38:31,080 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 [2023-02-17 09:38:31,081 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 [2023-02-17 09:38:31,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:31,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:38:31,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:31,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:31,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:38:31,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:38:31,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:38:31,121 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 [2023-02-17 09:38:31,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,124 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) [2023-02-17 09:38:31,131 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 [2023-02-17 09:38:31,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:31,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:38:31,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:38:31,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:31,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:31,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:38:31,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:38:31,143 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 [2023-02-17 09:38:31,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:38:31,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-17 09:38:31,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,154 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) [2023-02-17 09:38:31,155 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 [2023-02-17 09:38:31,157 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 [2023-02-17 09:38:31,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:38:31,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:38:31,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:38:31,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:38:31,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:38:31,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:38:31,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:38:31,190 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-17 09:38:31,190 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-02-17 09:38:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:38:31,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,250 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) [2023-02-17 09:38:31,251 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 [2023-02-17 09:38:31,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:38:31,260 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-17 09:38:31,260 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:38:31,260 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2095 Supporting invariants [] [2023-02-17 09:38:31,267 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 [2023-02-17 09:38:31,271 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-02-17 09:38:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:31,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:38:31,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:31,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:38:31,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,338 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-17 09:38:31,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) 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) [2023-02-17 09:38:31,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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). 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 25 states and 34 transitions. Complement of second has 7 states. [2023-02-17 09:38:31,364 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 [2023-02-17 09:38:31,367 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) [2023-02-17 09:38:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-17 09:38:31,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2023-02-17 09:38:31,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:38:31,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-17 09:38:31,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:38:31,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-17 09:38:31,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:38:31,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2023-02-17 09:38:31,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 8 states and 10 transitions. [2023-02-17 09:38:31,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:31,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-17 09:38:31,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2023-02-17 09:38:31,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:31,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2023-02-17 09:38:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2023-02-17 09:38:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2023-02-17 09:38:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2023-02-17 09:38:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2023-02-17 09:38:31,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2023-02-17 09:38:31,391 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2023-02-17 09:38:31,391 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-17 09:38:31,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2023-02-17 09:38:31,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:31,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:31,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-17 09:38:31,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:31,392 INFO L748 eck$LassoCheckResult]: Stem: 81#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 83#L13-3 assume !(main_~i~0#1 < 1048); 77#L17-2 [2023-02-17 09:38:31,393 INFO L750 eck$LassoCheckResult]: Loop: 77#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 78#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 77#L17-2 [2023-02-17 09:38:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2023-02-17 09:38:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954024336] [2023-02-17 09:38:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:38:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954024336] [2023-02-17 09:38:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954024336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:38:31,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:38:31,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:38:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388293852] [2023-02-17 09:38:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:38:31,430 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:38:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2023-02-17 09:38:31,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507489944] [2023-02-17 09:38:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:31,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:31,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:38:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:38:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:38:31,443 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-02-17 09:38:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:38:31,450 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2023-02-17 09:38:31,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2023-02-17 09:38:31,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2023-02-17 09:38:31,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:31,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-17 09:38:31,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2023-02-17 09:38:31,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:31,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-02-17 09:38:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2023-02-17 09:38:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2023-02-17 09:38:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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) [2023-02-17 09:38:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2023-02-17 09:38:31,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2023-02-17 09:38:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:38:31,454 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2023-02-17 09:38:31,454 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-17 09:38:31,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2023-02-17 09:38:31,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:31,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:31,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-17 09:38:31,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:31,456 INFO L748 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 104#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 100#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 101#L13-3 assume !(main_~i~0#1 < 1048); 99#L17-2 [2023-02-17 09:38:31,456 INFO L750 eck$LassoCheckResult]: Loop: 99#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 98#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 99#L17-2 [2023-02-17 09:38:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2023-02-17 09:38:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726800134] [2023-02-17 09:38:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:31,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-17 09:38:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:38:31,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726800134] [2023-02-17 09:38:31,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726800134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:38:31,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709859968] [2023-02-17 09:38:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:38:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:38:31,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 09:38:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:31,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 09:38:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:38:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709859968] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:38:31,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:38:31,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-02-17 09:38:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606145141] [2023-02-17 09:38:31,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:38:31,598 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:38:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 2 times [2023-02-17 09:38:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851467104] [2023-02-17 09:38:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:31,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:31,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:38:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:38:31,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:38:31,631 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-02-17 09:38:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:38:31,657 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2023-02-17 09:38:31,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2023-02-17 09:38:31,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2023-02-17 09:38:31,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:31,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-17 09:38:31,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2023-02-17 09:38:31,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:31,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-02-17 09:38:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2023-02-17 09:38:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-17 09:38:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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) [2023-02-17 09:38:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-02-17 09:38:31,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-02-17 09:38:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:38:31,661 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-02-17 09:38:31,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-17 09:38:31,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2023-02-17 09:38:31,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:31,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:31,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2023-02-17 09:38:31,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:31,662 INFO L748 eck$LassoCheckResult]: Stem: 156#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 158#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 154#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 155#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 159#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 164#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 163#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 162#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 161#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 160#L13-3 assume !(main_~i~0#1 < 1048); 152#L17-2 [2023-02-17 09:38:31,662 INFO L750 eck$LassoCheckResult]: Loop: 152#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 153#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 152#L17-2 [2023-02-17 09:38:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2023-02-17 09:38:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860961391] [2023-02-17 09:38:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:38:31,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860961391] [2023-02-17 09:38:31,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860961391] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:38:31,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661109876] [2023-02-17 09:38:31,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:38:31,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:38:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:31,737 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:38:31,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 09:38:31,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:38:31,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:38:31,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 09:38:31,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:38:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:31,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661109876] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:38:31,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:38:31,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-17 09:38:31,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081422091] [2023-02-17 09:38:31,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:38:31,908 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:38:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 3 times [2023-02-17 09:38:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753782515] [2023-02-17 09:38:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:31,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:31,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:38:31,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 09:38:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:38:31,933 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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) [2023-02-17 09:38:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:38:31,974 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-02-17 09:38:31,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2023-02-17 09:38:31,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2023-02-17 09:38:31,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:31,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-17 09:38:31,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2023-02-17 09:38:31,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:31,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-17 09:38:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2023-02-17 09:38:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-17 09:38:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 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) [2023-02-17 09:38:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-17 09:38:31,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-17 09:38:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:38:31,982 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-17 09:38:31,983 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-17 09:38:31,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2023-02-17 09:38:31,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:31,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:31,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:31,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2023-02-17 09:38:31,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:31,986 INFO L748 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 270#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 271#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 272#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 268#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 269#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 290#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 289#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 288#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 287#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 286#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 285#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 284#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 283#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 282#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 281#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 280#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 279#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 278#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 277#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 276#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 275#L13-3 assume !(main_~i~0#1 < 1048); 266#L17-2 [2023-02-17 09:38:31,986 INFO L750 eck$LassoCheckResult]: Loop: 266#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 267#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 266#L17-2 [2023-02-17 09:38:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2023-02-17 09:38:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:31,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144691861] [2023-02-17 09:38:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:38:32,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144691861] [2023-02-17 09:38:32,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144691861] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:38:32,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403067635] [2023-02-17 09:38:32,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:38:32,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:38:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:32,175 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:38:32,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 09:38:32,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-17 09:38:32,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:38:32,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 09:38:32,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:32,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:38:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:32,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403067635] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:38:32,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:38:32,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-02-17 09:38:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470341637] [2023-02-17 09:38:32,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:38:32,563 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:38:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 4 times [2023-02-17 09:38:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889211681] [2023-02-17 09:38:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:32,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:32,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:38:32,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 09:38:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-02-17 09:38:32,576 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 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) [2023-02-17 09:38:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:38:32,629 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2023-02-17 09:38:32,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2023-02-17 09:38:32,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:32,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 50 transitions. [2023-02-17 09:38:32,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:32,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-17 09:38:32,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 50 transitions. [2023-02-17 09:38:32,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:32,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2023-02-17 09:38:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 50 transitions. [2023-02-17 09:38:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-02-17 09:38:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 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) [2023-02-17 09:38:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2023-02-17 09:38:32,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2023-02-17 09:38:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 09:38:32,635 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2023-02-17 09:38:32,635 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-17 09:38:32,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 50 transitions. [2023-02-17 09:38:32,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:32,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:32,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:32,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1] [2023-02-17 09:38:32,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:32,637 INFO L748 eck$LassoCheckResult]: Stem: 504#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 506#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 507#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 508#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 502#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 503#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 548#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 547#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 546#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 545#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 544#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 543#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 542#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 541#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 540#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 539#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 538#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 537#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 536#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 535#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 534#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 533#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 532#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 531#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 530#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 529#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 528#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 527#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 526#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 525#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 524#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 523#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 522#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 521#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 520#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 519#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 518#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 517#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 516#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 515#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 514#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 513#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 512#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 511#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 510#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 509#L13-3 assume !(main_~i~0#1 < 1048); 500#L17-2 [2023-02-17 09:38:32,638 INFO L750 eck$LassoCheckResult]: Loop: 500#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 501#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 500#L17-2 [2023-02-17 09:38:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -111832455, now seen corresponding path program 4 times [2023-02-17 09:38:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:32,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573746632] [2023-02-17 09:38:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:38:33,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573746632] [2023-02-17 09:38:33,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573746632] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:38:33,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531330468] [2023-02-17 09:38:33,099 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:38:33,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:38:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:33,101 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:38:33,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 09:38:33,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:38:33,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:38:33,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 09:38:33,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:33,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:38:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:33,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531330468] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:38:33,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:38:33,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2023-02-17 09:38:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603309959] [2023-02-17 09:38:33,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:38:33,911 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:38:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 5 times [2023-02-17 09:38:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222514443] [2023-02-17 09:38:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:33,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:33,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:38:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-17 09:38:33,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-02-17 09:38:33,933 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. cyclomatic complexity: 3 Second operand has 49 states, 48 states have (on average 2.0) internal successors, (96), 49 states have internal predecessors, (96), 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) [2023-02-17 09:38:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:38:34,042 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2023-02-17 09:38:34,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 98 transitions. [2023-02-17 09:38:34,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:34,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 98 transitions. [2023-02-17 09:38:34,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:34,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-17 09:38:34,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 98 transitions. [2023-02-17 09:38:34,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:34,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 98 transitions. [2023-02-17 09:38:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 98 transitions. [2023-02-17 09:38:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-02-17 09:38:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 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) [2023-02-17 09:38:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2023-02-17 09:38:34,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 98 transitions. [2023-02-17 09:38:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-17 09:38:34,063 INFO L428 stractBuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2023-02-17 09:38:34,063 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-17 09:38:34,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 98 transitions. [2023-02-17 09:38:34,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:34,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:34,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:34,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1] [2023-02-17 09:38:34,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:34,070 INFO L748 eck$LassoCheckResult]: Stem: 978#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 980#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 981#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 982#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 976#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 977#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1070#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1069#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1068#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1067#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1066#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1065#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1064#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1063#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1062#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1061#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1060#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1059#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1058#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1057#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1056#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1055#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1054#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1053#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1052#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1051#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1050#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1049#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1048#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1047#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1046#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1045#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1044#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1043#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1042#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1041#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1040#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1039#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1038#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1037#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1036#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1035#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1034#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1033#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1032#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1031#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1030#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1029#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1028#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1027#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1026#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1025#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1024#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1023#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1022#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1021#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1020#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1019#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1018#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1017#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1016#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1015#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1014#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1013#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1012#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1011#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1010#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1009#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1008#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1007#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1006#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1005#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1004#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1003#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1002#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1001#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1000#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 999#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 998#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 997#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 996#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 995#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 994#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 993#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 992#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 991#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 990#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 989#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 988#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 987#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 986#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 985#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 984#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 983#L13-3 assume !(main_~i~0#1 < 1048); 974#L17-2 [2023-02-17 09:38:34,072 INFO L750 eck$LassoCheckResult]: Loop: 974#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 975#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 974#L17-2 [2023-02-17 09:38:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1497227703, now seen corresponding path program 5 times [2023-02-17 09:38:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772325938] [2023-02-17 09:38:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:38:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:35,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:38:35,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772325938] [2023-02-17 09:38:35,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772325938] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:38:35,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392560389] [2023-02-17 09:38:35,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 09:38:35,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:38:35,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:38:35,382 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:38:35,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-17 09:38:54,228 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-02-17 09:38:54,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:38:54,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-17 09:38:54,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:38:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:54,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:38:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:38:56,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392560389] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:38:56,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:38:56,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2023-02-17 09:38:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111469858] [2023-02-17 09:38:56,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:38:56,953 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:38:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 6 times [2023-02-17 09:38:56,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:56,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590197993] [2023-02-17 09:38:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:56,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:38:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:38:56,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:38:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:38:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-02-17 09:38:56,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-02-17 09:38:56,969 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. cyclomatic complexity: 3 Second operand has 97 states, 96 states have (on average 2.0) internal successors, (192), 97 states have internal predecessors, (192), 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) [2023-02-17 09:38:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:38:57,196 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2023-02-17 09:38:57,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 194 transitions. [2023-02-17 09:38:57,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:57,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 194 transitions. [2023-02-17 09:38:57,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-17 09:38:57,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-17 09:38:57,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 194 transitions. [2023-02-17 09:38:57,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:38:57,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193 states and 194 transitions. [2023-02-17 09:38:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 194 transitions. [2023-02-17 09:38:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-02-17 09:38:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 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) [2023-02-17 09:38:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2023-02-17 09:38:57,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 193 states and 194 transitions. [2023-02-17 09:38:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-02-17 09:38:57,220 INFO L428 stractBuchiCegarLoop]: Abstraction has 193 states and 194 transitions. [2023-02-17 09:38:57,220 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-17 09:38:57,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 194 transitions. [2023-02-17 09:38:57,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:38:57,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:38:57,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:38:57,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1] [2023-02-17 09:38:57,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:38:57,226 INFO L748 eck$LassoCheckResult]: Stem: 1932#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 1934#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1935#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1936#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1930#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1931#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2120#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2119#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2118#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2117#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2116#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2115#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2114#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2113#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2112#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2111#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2110#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2109#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2108#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2107#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2106#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2105#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2104#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2103#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2102#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2101#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2100#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2099#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2098#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2097#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2096#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2095#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2094#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2093#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2092#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2091#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2090#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2089#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2088#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2087#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2086#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2085#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2084#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2083#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2082#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2081#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2080#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2079#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2078#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2077#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2076#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2075#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2074#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2073#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2072#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2071#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2070#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2069#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2068#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2067#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2066#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2065#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2064#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2063#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2062#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2061#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2060#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2059#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2058#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2057#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2056#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2055#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2054#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2053#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2052#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2051#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2050#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2049#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2048#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2047#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2046#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2045#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2044#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2043#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2042#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2041#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2040#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2039#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2038#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2037#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2036#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2035#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2034#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2033#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2032#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2031#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2030#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2029#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2028#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2027#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2026#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2025#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2024#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2023#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2022#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2021#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2020#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2019#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2018#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2017#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2016#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2015#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2014#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2013#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2012#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2011#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2010#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2009#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2008#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2007#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2006#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2005#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2004#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2003#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2002#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2001#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2000#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1999#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1998#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1997#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1996#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1995#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1994#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1993#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1992#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1991#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1990#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1989#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1988#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1987#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1986#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1985#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1984#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1983#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1982#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1981#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1980#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1979#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1978#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1977#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1976#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1975#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1974#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1973#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1972#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1971#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1970#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1969#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1968#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1967#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1966#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1965#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1964#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1963#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1962#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1961#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1960#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1959#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1958#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1957#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1956#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1955#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1954#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1953#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1952#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1951#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1950#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1949#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1948#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1947#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1946#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1945#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1944#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1943#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1942#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1941#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1940#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1939#L13-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1938#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1937#L13-3 assume !(main_~i~0#1 < 1048); 1928#L17-2 [2023-02-17 09:38:57,227 INFO L750 eck$LassoCheckResult]: Loop: 1928#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 1929#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 1928#L17-2 [2023-02-17 09:38:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:38:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2115802601, now seen corresponding path program 6 times [2023-02-17 09:38:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:38:57,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919561341] [2023-02-17 09:38:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:38:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:38:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:39:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:39:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:39:01,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919561341] [2023-02-17 09:39:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919561341] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:39:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977641206] [2023-02-17 09:39:01,580 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 09:39:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:39:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:39:01,581 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:39:01,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process