./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/queue_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i ./goblint.2024-05-21_14-57-05.files/protection/queue_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 11:17:51,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:17:51,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:17:51,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:17:51,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:17:51,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:17:51,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:17:51,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:17:51,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:17:51,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:17:51,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:17:51,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:17:51,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:17:51,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:17:51,711 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:17:51,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:17:51,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:17:51,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:17:51,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:17:51,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:17:51,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:17:51,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:17:51,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:17:51,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:17:51,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:17:51,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:17:51,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:17:51,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:17:51,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:17:51,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:17:51,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:17:51,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:17:51,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:17:51,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:17:51,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:17:51,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:17:51,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:17:51,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:17:51,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:17:51,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:17:51,717 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:17:51,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:17:51,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:17:51,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 11:17:51,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:17:51,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:17:51,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:17:51,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:17:51,945 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:17:51,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2024-06-14 11:17:53,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:17:53,324 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:17:53,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2024-06-14 11:17:53,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed624cff/53781c3a110a4cd3884f49fa737b6677/FLAGadc177a82 [2024-06-14 11:17:53,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed624cff/53781c3a110a4cd3884f49fa737b6677 [2024-06-14 11:17:53,357 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:17:53,358 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:17:53,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/queue_ok.yml/witness.yml [2024-06-14 11:17:53,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:17:53,438 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:17:53,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:17:53,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:17:53,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:17:53,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:17:53" (1/2) ... [2024-06-14 11:17:53,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4489f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:17:53, skipping insertion in model container [2024-06-14 11:17:53,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:17:53" (1/2) ... [2024-06-14 11:17:53,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ce049b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:17:53, skipping insertion in model container [2024-06-14 11:17:53,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:17:53" (2/2) ... [2024-06-14 11:17:53,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4489f0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:53, skipping insertion in model container [2024-06-14 11:17:53,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:17:53" (2/2) ... [2024-06-14 11:17:53,447 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:17:53,476 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:17:53,477 INFO L97 edCorrectnessWitness]: Location invariant before [L1054-L1054] ! multithreaded || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20) [2024-06-14 11:17:53,477 INFO L97 edCorrectnessWitness]: Location invariant before [L1053-L1053] ! multithreaded || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20) [2024-06-14 11:17:53,477 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:17:53,477 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-14 11:17:53,478 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 0; [2024-06-14 11:17:53,478 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-14 11:17:53,478 INFO L106 edCorrectnessWitness]: ghost_update [L1026-L1026] m_locked = 1; [2024-06-14 11:17:53,479 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 0; [2024-06-14 11:17:53,479 INFO L106 edCorrectnessWitness]: ghost_update [L1052-L1052] multithreaded = 1; [2024-06-14 11:17:53,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:17:53,905 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:17:53,915 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 11:17:54,050 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:17:54,104 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:17:54,105 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54 WrapperNode [2024-06-14 11:17:54,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:17:54,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:17:54,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:17:54,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:17:54,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,179 INFO L138 Inliner]: procedures = 274, calls = 235, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 940 [2024-06-14 11:17:54,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:17:54,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:17:54,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:17:54,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:17:54,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,217 INFO L175 MemorySlicer]: Split 218 memory accesses to 4 slices as follows [2, 5, 3, 208]. 95 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 13 writes are split as follows [0, 0, 2, 11]. [2024-06-14 11:17:54,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:17:54,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:17:54,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:17:54,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:17:54,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (1/1) ... [2024-06-14 11:17:54,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:17:54,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:17:54,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 11:17:54,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 11:17:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-14 11:17:54,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-14 11:17:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-14 11:17:54,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-14 11:17:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-14 11:17:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 11:17:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 11:17:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-14 11:17:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:17:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 11:17:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 11:17:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-14 11:17:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:17:54,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:17:54,343 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:17:54,492 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:17:54,494 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:17:55,082 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:17:55,082 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:17:56,717 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:17:56,717 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-14 11:17:56,719 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:17:56 BoogieIcfgContainer [2024-06-14 11:17:56,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:17:56,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:17:56,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:17:56,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:17:56,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:17:53" (1/4) ... [2024-06-14 11:17:56,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a466252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:17:56, skipping insertion in model container [2024-06-14 11:17:56,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:17:53" (2/4) ... [2024-06-14 11:17:56,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a466252 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:17:56, skipping insertion in model container [2024-06-14 11:17:56,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:17:54" (3/4) ... [2024-06-14 11:17:56,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a466252 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:17:56, skipping insertion in model container [2024-06-14 11:17:56,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:17:56" (4/4) ... [2024-06-14 11:17:56,728 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-06-14 11:17:56,743 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:17:56,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 11:17:56,744 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:17:56,793 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 11:17:56,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 86 flow [2024-06-14 11:17:56,855 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-06-14 11:17:56,855 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 11:17:56,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 4/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-06-14 11:17:56,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 86 flow [2024-06-14 11:17:56,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 73 flow [2024-06-14 11:17:56,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:17:56,879 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57cbd39a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:17:56,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 11:17:56,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:17:56,887 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 11:17:56,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:17:56,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:17:56,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 11:17:56,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:17:56,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:17:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash -144037209, now seen corresponding path program 1 times [2024-06-14 11:17:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:17:56,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713665417] [2024-06-14 11:17:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:17:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:17:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:17:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:17:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:17:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713665417] [2024-06-14 11:17:57,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713665417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:17:57,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:17:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:17:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084083908] [2024-06-14 11:17:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:17:57,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:17:57,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:17:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:17:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:17:57,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 11:17:57,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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) [2024-06-14 11:17:57,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:17:57,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 11:17:57,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:17:58,062 INFO L124 PetriNetUnfolderBase]: 552/906 cut-off events. [2024-06-14 11:17:58,076 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-06-14 11:17:58,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 906 events. 552/906 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3941 event pairs, 246 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1674. Up to 457 conditions per place. [2024-06-14 11:17:58,082 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 37 selfloop transitions, 2 changer transitions 8/51 dead transitions. [2024-06-14 11:17:58,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 51 transitions, 211 flow [2024-06-14 11:17:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:17:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:17:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-14 11:17:58,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2024-06-14 11:17:58,104 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 73 flow. Second operand 3 states and 67 transitions. [2024-06-14 11:17:58,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 51 transitions, 211 flow [2024-06-14 11:17:58,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 203 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 11:17:58,109 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 75 flow [2024-06-14 11:17:58,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2024-06-14 11:17:58,113 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2024-06-14 11:17:58,128 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 75 flow [2024-06-14 11:17:58,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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) [2024-06-14 11:17:58,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:17:58,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:17:58,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:17:58,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:17:58,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:17:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 203118991, now seen corresponding path program 1 times [2024-06-14 11:17:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:17:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672315955] [2024-06-14 11:17:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:17:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:17:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:17:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:17:58,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:17:58,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672315955] [2024-06-14 11:17:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672315955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:17:58,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:17:58,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:17:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729689485] [2024-06-14 11:17:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:17:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:17:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:17:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:17:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:17:58,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 11:17:58,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2024-06-14 11:17:58,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:17:58,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 11:17:58,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:17:59,007 INFO L124 PetriNetUnfolderBase]: 463/784 cut-off events. [2024-06-14 11:17:59,008 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-06-14 11:17:59,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 784 events. 463/784 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3352 event pairs, 150 based on Foata normal form. 32/777 useless extension candidates. Maximal degree in co-relation 1015. Up to 303 conditions per place. [2024-06-14 11:17:59,012 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 51 selfloop transitions, 4 changer transitions 2/61 dead transitions. [2024-06-14 11:17:59,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 257 flow [2024-06-14 11:17:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:17:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:17:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-06-14 11:17:59,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-06-14 11:17:59,017 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 75 flow. Second operand 4 states and 83 transitions. [2024-06-14 11:17:59,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 257 flow [2024-06-14 11:17:59,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:17:59,025 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 98 flow [2024-06-14 11:17:59,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2024-06-14 11:17:59,026 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2024-06-14 11:17:59,026 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 98 flow [2024-06-14 11:17:59,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2024-06-14 11:17:59,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:17:59,027 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:17:59,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 11:17:59,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:17:59,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:17:59,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2001724160, now seen corresponding path program 2 times [2024-06-14 11:17:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:17:59,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199002823] [2024-06-14 11:17:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:17:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:17:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:17:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:17:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:17:59,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199002823] [2024-06-14 11:17:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199002823] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 11:17:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649245955] [2024-06-14 11:17:59,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-14 11:17:59,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:17:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:17:59,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:17:59,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-14 11:18:00,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-14 11:18:00,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 11:18:00,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-14 11:18:00,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:18:00,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-14 11:18:00,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2024-06-14 11:18:00,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-06-14 11:18:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:00,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:18:00,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-14 11:18:00,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-14 11:18:00,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-14 11:18:00,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-14 11:18:00,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-14 11:18:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649245955] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:18:01,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 11:18:01,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-06-14 11:18:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925943566] [2024-06-14 11:18:01,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 11:18:01,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:18:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:18:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:18:01,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 11:18:01,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 98 flow. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:01,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:01,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 11:18:01,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:01,585 INFO L124 PetriNetUnfolderBase]: 895/1504 cut-off events. [2024-06-14 11:18:01,585 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-06-14 11:18:01,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 1504 events. 895/1504 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7344 event pairs, 153 based on Foata normal form. 128/1627 useless extension candidates. Maximal degree in co-relation 2452. Up to 295 conditions per place. [2024-06-14 11:18:01,591 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 95 selfloop transitions, 9 changer transitions 17/125 dead transitions. [2024-06-14 11:18:01,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 125 transitions, 564 flow [2024-06-14 11:18:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:18:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:18:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-14 11:18:01,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-06-14 11:18:01,593 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 98 flow. Second operand 8 states and 177 transitions. [2024-06-14 11:18:01,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 125 transitions, 564 flow [2024-06-14 11:18:01,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 125 transitions, 557 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:01,596 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 168 flow [2024-06-14 11:18:01,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-14 11:18:01,597 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2024-06-14 11:18:01,597 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 168 flow [2024-06-14 11:18:01,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:01,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:01,597 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:01,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-14 11:18:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:18:01,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:01,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1146415424, now seen corresponding path program 3 times [2024-06-14 11:18:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801604746] [2024-06-14 11:18:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:03,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801604746] [2024-06-14 11:18:03,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801604746] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 11:18:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124249325] [2024-06-14 11:18:03,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-14 11:18:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:18:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:18:03,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:18:03,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-14 11:18:04,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-06-14 11:18:04,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 11:18:04,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 36 conjunts are in the unsatisfiable core [2024-06-14 11:18:04,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:18:04,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-14 11:18:04,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2024-06-14 11:18:04,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-06-14 11:18:04,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 132 [2024-06-14 11:18:04,314 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 11:18:04,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 [2024-06-14 11:18:04,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 137 [2024-06-14 11:18:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2024-06-14 11:18:04,382 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 11:18:04,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 142 [2024-06-14 11:18:04,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 134 [2024-06-14 11:18:04,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:18:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:04,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:18:04,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-14 11:18:26,305 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse3 .cse5))) (let ((.cse1 (not (= 21 .cse2))) (.cse0 (select .cse3 (+ |c_~#queue~0.offset| 80)))) (and (or (and (<= 0 .cse0) (<= .cse0 20)) .cse1) (not (= .cse2 20)) (let ((.cse4 (+ (* .cse2 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_691 Int)) (= (select (store .cse3 .cse4 v_ArrVal_691) .cse5) 20)) (let ((.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (+ (select .cse3 .cse6) 1))) (and (not (= 22 .cse2)) (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int)) (or (not (= 18 (select (store .cse3 .cse4 (select (store (store (store .cse3 .cse4 v_DerPreprocessor_171) .cse6 v_DerPreprocessor_172) .cse5 19) .cse4)) .cse5))) (not (= .cse7 v_DerPreprocessor_172)))) (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_173 Int)) (let ((.cse12 (store .cse3 .cse4 v_DerPreprocessor_171))) (let ((.cse13 (store .cse3 .cse4 (select (store (store .cse12 .cse6 v_DerPreprocessor_172) .cse5 v_DerPreprocessor_173) .cse4)))) (or (forall ((v_prenex_59 Int) (v_DerPreprocessor_165 Int) (v_DerPreprocessor_113 Int) (v_DerPreprocessor_115 Int)) (let ((.cse11 (* v_DerPreprocessor_173 4))) (let ((.cse9 (store .cse12 (+ .cse11 |c_~#queue~0.offset|) v_DerPreprocessor_165)) (.cse10 (+ .cse11 |c_~#queue~0.offset| 4))) (let ((.cse8 (store (store (store .cse9 .cse10 v_DerPreprocessor_113) .cse6 (+ 2 v_DerPreprocessor_172)) .cse5 v_DerPreprocessor_115))) (or (= (select (store .cse8 (+ (* v_DerPreprocessor_115 4) |c_~#queue~0.offset|) v_prenex_59) .cse5) 20) (< v_DerPreprocessor_115 20) (not (= v_DerPreprocessor_115 (+ (select (store (store (store .cse9 .cse6 (+ v_DerPreprocessor_172 1)) .cse5 (+ v_DerPreprocessor_173 1)) .cse10 (select .cse8 .cse10)) .cse5) 1)))))))) (not (= (+ 1 (select .cse13 .cse5)) v_DerPreprocessor_173)) (not (= (+ (select .cse13 .cse6) 1) v_DerPreprocessor_172)))))) (or (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_173 Int) (v_prenex_58 Int) (v_DerPreprocessor_166 Int) (v_DerPreprocessor_124 Int)) (let ((.cse15 (store .cse3 .cse4 v_DerPreprocessor_171))) (let ((.cse14 (store .cse3 .cse4 (select (store (store .cse15 .cse6 v_DerPreprocessor_172) .cse5 v_DerPreprocessor_173) .cse4)))) (or (not (= (+ 1 (select .cse14 .cse5)) v_DerPreprocessor_173)) (not (= (+ (select .cse14 .cse6) 1) v_DerPreprocessor_172)) (= (select (let ((.cse16 (* v_DerPreprocessor_173 4))) (store (store (store (store (store .cse15 (+ .cse16 |c_~#queue~0.offset|) v_DerPreprocessor_166) (+ .cse16 |c_~#queue~0.offset| 4) v_DerPreprocessor_124) .cse6 (+ 2 v_DerPreprocessor_172)) .cse5 (+ 2 v_DerPreprocessor_173)) (+ .cse16 |c_~#queue~0.offset| 8) v_prenex_58)) .cse5) 20))))) (< .cse0 21)) (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int)) (or (not (= 19 (select (store .cse3 .cse4 (select (store (store (store .cse3 .cse4 v_DerPreprocessor_171) .cse6 v_DerPreprocessor_172) .cse5 20) .cse4)) .cse5))) (not (= .cse7 v_DerPreprocessor_172)))) (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_173 Int)) (let ((.cse21 (store .cse3 .cse4 v_DerPreprocessor_171))) (let ((.cse17 (store .cse3 .cse4 (select (store (store .cse21 .cse6 v_DerPreprocessor_172) .cse5 v_DerPreprocessor_173) .cse4)))) (or (not (= (+ 1 (select .cse17 .cse5)) v_DerPreprocessor_173)) (not (= (+ (select .cse17 .cse6) 1) v_DerPreprocessor_172)) (forall ((v_DerPreprocessor_132 Int) (v_DerPreprocessor_134 Int) (v_DerPreprocessor_146 Int)) (or (not (= (+ (select (let ((.cse20 (* v_DerPreprocessor_173 4))) (let ((.cse18 (store .cse21 (+ .cse20 |c_~#queue~0.offset|) v_DerPreprocessor_146)) (.cse19 (+ .cse20 |c_~#queue~0.offset| 4))) (store (store (store .cse18 .cse6 (+ v_DerPreprocessor_172 1)) .cse5 (+ v_DerPreprocessor_173 1)) .cse19 (select (store (store (store .cse18 .cse19 v_DerPreprocessor_132) .cse6 (+ 2 v_DerPreprocessor_172)) .cse5 v_DerPreprocessor_134) .cse19)))) .cse5) 1) v_DerPreprocessor_134)) (< 0 (+ 2 v_DerPreprocessor_134)))))))) .cse1 (or (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_173 Int) (v_DerPreprocessor_154 Int) (v_DerPreprocessor_121 Int) (v_prenex_60 Int)) (let ((.cse23 (store .cse3 .cse4 v_DerPreprocessor_171))) (let ((.cse22 (store .cse3 .cse4 (select (store (store .cse23 .cse6 v_DerPreprocessor_172) .cse5 v_DerPreprocessor_173) .cse4)))) (or (not (= (+ 1 (select .cse22 .cse5)) v_DerPreprocessor_173)) (not (= (+ (select .cse22 .cse6) 1) v_DerPreprocessor_172)) (= (select (let ((.cse24 (* v_DerPreprocessor_173 4))) (store (store (store (store (store .cse23 (+ .cse24 |c_~#queue~0.offset|) v_DerPreprocessor_154) (+ .cse24 |c_~#queue~0.offset| 4) v_DerPreprocessor_121) .cse6 (+ 2 v_DerPreprocessor_172)) .cse5 (+ 2 v_DerPreprocessor_173)) (+ .cse24 |c_~#queue~0.offset| 8) v_prenex_60)) .cse5) 20))))) (< 0 (+ .cse0 1))) (forall ((v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_173 Int)) (let ((.cse29 (store .cse3 .cse4 v_DerPreprocessor_171))) (let ((.cse30 (store .cse3 .cse4 (select (store (store .cse29 .cse6 v_DerPreprocessor_172) .cse5 v_DerPreprocessor_173) .cse4)))) (or (forall ((v_DerPreprocessor_140 Int) (v_ArrVal_704 Int) (v_DerPreprocessor_148 Int) (v_DerPreprocessor_138 Int)) (let ((.cse28 (* v_DerPreprocessor_173 4))) (let ((.cse26 (store .cse29 (+ .cse28 |c_~#queue~0.offset|) v_DerPreprocessor_148)) (.cse27 (+ .cse28 |c_~#queue~0.offset| 4))) (let ((.cse25 (store (store (store .cse26 .cse27 v_DerPreprocessor_138) .cse6 (+ 2 v_DerPreprocessor_172)) .cse5 v_DerPreprocessor_140))) (or (not (= 20 (select (store .cse25 (+ |c_~#queue~0.offset| (* v_DerPreprocessor_140 4)) v_ArrVal_704) .cse5))) (not (= (+ (select (store (store (store .cse26 .cse6 (+ v_DerPreprocessor_172 1)) .cse5 (+ v_DerPreprocessor_173 1)) .cse27 (select .cse25 .cse27)) .cse5) 1) v_DerPreprocessor_140))))))) (not (= (+ 1 (select .cse30 .cse5)) v_DerPreprocessor_173)) (not (= (+ (select .cse30 .cse6) 1) v_DerPreprocessor_172))))))))))))))) is different from false [2024-06-14 11:18:26,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:18:26,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-06-14 11:18:26,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:18:26,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1474 treesize of output 938 [2024-06-14 11:18:30,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse12 .cse3))) (let ((.cse40 (* .cse0 4)) (.cse41 (select .cse12 .cse2))) (let ((.cse27 (+ 2 .cse41)) (.cse9 (+ .cse41 1)) (.cse10 (+ .cse0 1)) (.cse11 (+ .cse40 |c_~#queue~0.offset| 4)) (.cse13 (+ .cse40 |c_~#queue~0.offset|)) (.cse25 (select .cse12 (+ |c_~#queue~0.offset| 80)))) (and (not (= 22 .cse0)) (forall ((v_DerPreprocessor_184 Int) (v_prenex_132 Int) (v_prenex_130 Int) (v_DerPreprocessor_132 Int) (v_prenex_131 Int) (v_DerPreprocessor_134 Int) (v_DerPreprocessor_146 Int)) (let ((.cse8 (store .cse12 .cse13 v_DerPreprocessor_184))) (let ((.cse6 (store .cse8 .cse11 v_prenex_130))) (let ((.cse7 (store (store (store .cse8 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store .cse6 .cse2 v_prenex_131) .cse3 v_prenex_132) .cse11)))) (or (not (= (+ (select (let ((.cse5 (* v_prenex_132 4))) (let ((.cse1 (store .cse6 (+ .cse5 |c_~#queue~0.offset|) v_DerPreprocessor_146)) (.cse4 (+ .cse5 |c_~#queue~0.offset| 4))) (store (store (store .cse1 .cse2 (+ v_prenex_131 1)) .cse3 (+ v_prenex_132 1)) .cse4 (select (store (store (store .cse1 .cse4 v_DerPreprocessor_132) .cse2 (+ 2 v_prenex_131)) .cse3 v_DerPreprocessor_134) .cse4)))) .cse3) 1) v_DerPreprocessor_134)) (not (= v_prenex_132 (+ (select .cse7 .cse3) 1))) (not (= v_prenex_131 (+ (select .cse7 .cse2) 1))) (< 0 (+ 2 v_DerPreprocessor_134))))))) (forall ((|v_t1Thread1of1ForFork0_~value~0#1_15| Int)) (not (= 20 (select (store .cse12 .cse13 |v_t1Thread1of1ForFork0_~value~0#1_15|) .cse3)))) (forall ((v_prenex_136 Int) (v_prenex_134 Int) (v_DerPreprocessor_184 Int) (v_prenex_135 Int) (v_DerPreprocessor_140 Int) (v_ArrVal_704 Int) (v_DerPreprocessor_148 Int) (v_DerPreprocessor_138 Int)) (let ((.cse18 (store .cse12 .cse13 v_DerPreprocessor_184))) (let ((.cse19 (store .cse18 .cse11 v_prenex_134)) (.cse20 (* v_prenex_136 4))) (let ((.cse15 (store .cse19 (+ .cse20 |c_~#queue~0.offset|) v_DerPreprocessor_148)) (.cse16 (+ .cse20 |c_~#queue~0.offset| 4))) (let ((.cse14 (store (store (store .cse18 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store .cse19 .cse2 v_prenex_135) .cse3 v_prenex_136) .cse11))) (.cse17 (store (store (store .cse15 .cse16 v_DerPreprocessor_138) .cse2 (+ 2 v_prenex_135)) .cse3 v_DerPreprocessor_140))) (or (not (= (+ (select .cse14 .cse2) 1) v_prenex_135)) (not (= v_prenex_136 (+ (select .cse14 .cse3) 1))) (not (= v_DerPreprocessor_140 (+ (select (store (store (store .cse15 .cse2 (+ v_prenex_135 1)) .cse3 (+ v_prenex_136 1)) .cse16 (select .cse17 .cse16)) .cse3) 1))) (not (= (select (store .cse17 (+ |c_~#queue~0.offset| (* v_DerPreprocessor_140 4)) v_ArrVal_704) .cse3) 20)))))))) (not (= .cse0 20)) (or (forall ((v_prenex_138 Int) (v_prenex_139 Int) (v_prenex_137 Int) (v_DerPreprocessor_184 Int) (v_prenex_58 Int) (v_DerPreprocessor_166 Int) (v_DerPreprocessor_124 Int)) (let ((.cse24 (store .cse12 .cse13 v_DerPreprocessor_184))) (let ((.cse22 (store .cse24 .cse11 v_prenex_137))) (let ((.cse21 (store (store (store .cse24 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store .cse22 .cse2 v_prenex_138) .cse3 v_prenex_139) .cse11)))) (or (not (= v_prenex_139 (+ (select .cse21 .cse3) 1))) (not (= v_prenex_138 (+ (select .cse21 .cse2) 1))) (= 20 (select (let ((.cse23 (* v_prenex_139 4))) (store (store (store (store (store .cse22 (+ .cse23 |c_~#queue~0.offset|) v_DerPreprocessor_166) (+ .cse23 |c_~#queue~0.offset| 4) v_DerPreprocessor_124) .cse2 (+ 2 v_prenex_138)) .cse3 (+ 2 v_prenex_139)) (+ .cse23 |c_~#queue~0.offset| 8) v_prenex_58)) .cse3))))))) (< .cse25 21)) (forall ((v_DerPreprocessor_184 Int) (v_prenex_133 Int)) (not (= (select (let ((.cse26 (store .cse12 .cse13 v_DerPreprocessor_184))) (store (store (store .cse26 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store (store .cse26 .cse11 v_prenex_133) .cse2 .cse27) .cse3 19) .cse11))) .cse3) 18))) (forall ((v_prenex_59 Int) (v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_184 Int) (v_DerPreprocessor_173 Int) (v_DerPreprocessor_165 Int) (v_DerPreprocessor_113 Int) (v_DerPreprocessor_115 Int)) (let ((.cse32 (store .cse12 .cse13 v_DerPreprocessor_184))) (let ((.cse33 (store .cse32 .cse11 v_DerPreprocessor_171)) (.cse34 (* v_DerPreprocessor_173 4))) (let ((.cse29 (store .cse33 (+ .cse34 |c_~#queue~0.offset|) v_DerPreprocessor_165)) (.cse30 (+ .cse34 |c_~#queue~0.offset| 4))) (let ((.cse28 (store (store (store .cse32 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store .cse33 .cse2 v_DerPreprocessor_172) .cse3 v_DerPreprocessor_173) .cse11))) (.cse31 (store (store (store .cse29 .cse30 v_DerPreprocessor_113) .cse2 (+ 2 v_DerPreprocessor_172)) .cse3 v_DerPreprocessor_115))) (or (not (= v_DerPreprocessor_172 (+ (select .cse28 .cse2) 1))) (not (= v_DerPreprocessor_115 (+ (select (store (store (store .cse29 .cse2 (+ v_DerPreprocessor_172 1)) .cse3 (+ v_DerPreprocessor_173 1)) .cse30 (select .cse31 .cse30)) .cse3) 1))) (not (= v_DerPreprocessor_173 (+ (select .cse28 .cse3) 1))) (< v_DerPreprocessor_115 20) (= (select (store .cse31 (+ (* v_DerPreprocessor_115 4) |c_~#queue~0.offset|) v_prenex_59) .cse3) 20))))))) (not (= 21 .cse0)) (forall ((v_prenex_126 Int) (v_DerPreprocessor_184 Int)) (not (= (select (let ((.cse35 (store .cse12 .cse13 v_DerPreprocessor_184))) (store (store (store .cse35 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store (store .cse35 .cse11 v_prenex_126) .cse2 .cse27) .cse3 20) .cse11))) .cse3) 19))) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_DerPreprocessor_184 Int) (v_DerPreprocessor_154 Int) (v_DerPreprocessor_121 Int) (v_prenex_129 Int) (v_prenex_60 Int)) (let ((.cse39 (store .cse12 .cse13 v_DerPreprocessor_184))) (let ((.cse36 (store .cse39 .cse11 v_prenex_127))) (let ((.cse38 (store (store (store .cse39 .cse2 .cse9) .cse3 .cse10) .cse11 (select (store (store .cse36 .cse2 v_prenex_128) .cse3 v_prenex_129) .cse11)))) (or (= (select (let ((.cse37 (* v_prenex_129 4))) (store (store (store (store (store .cse36 (+ .cse37 |c_~#queue~0.offset|) v_DerPreprocessor_154) (+ .cse37 |c_~#queue~0.offset| 4) v_DerPreprocessor_121) .cse2 (+ 2 v_prenex_128)) .cse3 (+ 2 v_prenex_129)) (+ .cse37 |c_~#queue~0.offset| 8) v_prenex_60)) .cse3) 20) (not (= (+ (select .cse38 .cse3) 1) v_prenex_129)) (not (= (+ (select .cse38 .cse2) 1) v_prenex_128))))))) (< 0 (+ .cse25 1))) (not (= 19 .cse0))))))) is different from false [2024-06-14 11:18:31,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:18:31,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 121 [2024-06-14 11:19:20,266 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse0 .cse2))) (let ((.cse42 (* .cse3 4))) (let ((.cse1 (+ .cse42 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_682 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_682) .cse2) 20))) (or (forall ((v_ArrVal_682 Int)) (= (select (store .cse0 .cse1 v_ArrVal_682) .cse2) 20)) (let ((.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse19 (select .cse0 .cse5))) (let ((.cse9 (+ 3 .cse19)) (.cse6 (+ 2 .cse19)) (.cse7 (+ 2 .cse3)) (.cse8 (+ .cse42 |c_~#queue~0.offset| 8)) (.cse10 (+ .cse42 |c_~#queue~0.offset| 4)) (.cse24 (select .cse0 (+ |c_~#queue~0.offset| 80)))) (and (not (= 22 .cse3)) (forall ((v_DerPreprocessor_218 Int) (v_DerPreprocessor_184 Int) (v_prenex_133 Int)) (not (= 18 (select (let ((.cse4 (store (store .cse0 .cse1 v_DerPreprocessor_218) .cse10 v_DerPreprocessor_184))) (store (store (store .cse4 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store (store .cse4 .cse8 v_prenex_133) .cse5 .cse9) .cse2 19) .cse8))) .cse2)))) (forall ((v_DerPreprocessor_190 Int) (v_prenex_126 Int) (v_DerPreprocessor_184 Int)) (not (= 19 (select (let ((.cse11 (store (store .cse0 .cse1 v_DerPreprocessor_190) .cse10 v_DerPreprocessor_184))) (store (store (store .cse11 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store (store .cse11 .cse8 v_prenex_126) .cse5 .cse9) .cse2 20) .cse8))) .cse2)))) (not (= .cse3 18)) (forall ((v_prenex_59 Int) (v_DerPreprocessor_171 Int) (v_DerPreprocessor_172 Int) (v_DerPreprocessor_184 Int) (v_DerPreprocessor_173 Int) (v_DerPreprocessor_165 Int) (v_DerPreprocessor_113 Int) (v_DerPreprocessor_115 Int) (v_DerPreprocessor_227 Int)) (let ((.cse16 (store (store .cse0 .cse1 v_DerPreprocessor_227) .cse10 v_DerPreprocessor_184))) (let ((.cse17 (store .cse16 .cse8 v_DerPreprocessor_171)) (.cse18 (* v_DerPreprocessor_173 4))) (let ((.cse14 (store .cse17 (+ .cse18 |c_~#queue~0.offset|) v_DerPreprocessor_165)) (.cse15 (+ .cse18 |c_~#queue~0.offset| 4))) (let ((.cse12 (store (store (store .cse14 .cse15 v_DerPreprocessor_113) .cse5 (+ 2 v_DerPreprocessor_172)) .cse2 v_DerPreprocessor_115)) (.cse13 (store (store (store .cse16 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store .cse17 .cse5 v_DerPreprocessor_172) .cse2 v_DerPreprocessor_173) .cse8)))) (or (= 20 (select (store .cse12 (+ (* v_DerPreprocessor_115 4) |c_~#queue~0.offset|) v_prenex_59) .cse2)) (not (= (+ (select .cse13 .cse2) 1) v_DerPreprocessor_173)) (not (= (+ (select (store (store (store .cse14 .cse5 (+ v_DerPreprocessor_172 1)) .cse2 (+ v_DerPreprocessor_173 1)) .cse15 (select .cse12 .cse15)) .cse2) 1) v_DerPreprocessor_115)) (< v_DerPreprocessor_115 20) (not (= v_DerPreprocessor_172 (+ (select .cse13 .cse5) 1))))))))) (forall ((|v_t1Thread1of1ForFork0_~value~0#1_15| Int) (v_DerPreprocessor_198 Int)) (not (= (select (store (store (store (store .cse0 .cse1 v_DerPreprocessor_198) .cse5 (+ .cse19 1)) .cse2 (+ .cse3 1)) .cse10 |v_t1Thread1of1ForFork0_~value~0#1_15|) .cse2) 20))) (or (forall ((v_prenex_138 Int) (v_DerPreprocessor_207 Int) (v_prenex_139 Int) (v_prenex_137 Int) (v_DerPreprocessor_184 Int) (v_prenex_58 Int) (v_DerPreprocessor_166 Int) (v_DerPreprocessor_124 Int)) (let ((.cse23 (store (store .cse0 .cse1 v_DerPreprocessor_207) .cse10 v_DerPreprocessor_184))) (let ((.cse20 (store .cse23 .cse8 v_prenex_137))) (let ((.cse22 (store (store (store .cse23 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store .cse20 .cse5 v_prenex_138) .cse2 v_prenex_139) .cse8)))) (or (= (select (let ((.cse21 (* v_prenex_139 4))) (store (store (store (store (store .cse20 (+ .cse21 |c_~#queue~0.offset|) v_DerPreprocessor_166) (+ .cse21 |c_~#queue~0.offset| 4) v_DerPreprocessor_124) .cse5 (+ 2 v_prenex_138)) .cse2 (+ 2 v_prenex_139)) (+ .cse21 |c_~#queue~0.offset| 8) v_prenex_58)) .cse2) 20) (not (= v_prenex_139 (+ (select .cse22 .cse2) 1))) (not (= (+ (select .cse22 .cse5) 1) v_prenex_138))))))) (< .cse24 21)) (forall ((v_DerPreprocessor_184 Int) (v_prenex_132 Int) (v_prenex_130 Int) (v_DerPreprocessor_132 Int) (v_prenex_131 Int) (v_DerPreprocessor_211 Int) (v_DerPreprocessor_134 Int) (v_DerPreprocessor_146 Int)) (let ((.cse30 (store (store .cse0 .cse1 v_DerPreprocessor_211) .cse10 v_DerPreprocessor_184))) (let ((.cse29 (store .cse30 .cse8 v_prenex_130))) (let ((.cse25 (store (store (store .cse30 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store .cse29 .cse5 v_prenex_131) .cse2 v_prenex_132) .cse8)))) (or (not (= v_prenex_132 (+ (select .cse25 .cse2) 1))) (not (= (+ (select .cse25 .cse5) 1) v_prenex_131)) (not (= v_DerPreprocessor_134 (+ (select (let ((.cse28 (* v_prenex_132 4))) (let ((.cse26 (store .cse29 (+ .cse28 |c_~#queue~0.offset|) v_DerPreprocessor_146)) (.cse27 (+ .cse28 |c_~#queue~0.offset| 4))) (store (store (store .cse26 .cse5 (+ v_prenex_131 1)) .cse2 (+ v_prenex_132 1)) .cse27 (select (store (store (store .cse26 .cse27 v_DerPreprocessor_132) .cse5 (+ 2 v_prenex_131)) .cse2 v_DerPreprocessor_134) .cse27)))) .cse2) 1))) (< 0 (+ 2 v_DerPreprocessor_134))))))) (forall ((v_prenex_136 Int) (v_prenex_134 Int) (v_DerPreprocessor_184 Int) (v_prenex_135 Int) (v_DerPreprocessor_140 Int) (v_DerPreprocessor_222 Int) (v_ArrVal_704 Int) (v_DerPreprocessor_148 Int) (v_DerPreprocessor_138 Int)) (let ((.cse35 (store (store .cse0 .cse1 v_DerPreprocessor_222) .cse10 v_DerPreprocessor_184))) (let ((.cse36 (store .cse35 .cse8 v_prenex_134)) (.cse37 (* v_prenex_136 4))) (let ((.cse31 (store .cse36 (+ .cse37 |c_~#queue~0.offset|) v_DerPreprocessor_148)) (.cse32 (+ .cse37 |c_~#queue~0.offset| 4))) (let ((.cse33 (store (store (store .cse31 .cse32 v_DerPreprocessor_138) .cse5 (+ 2 v_prenex_135)) .cse2 v_DerPreprocessor_140)) (.cse34 (store (store (store .cse35 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store .cse36 .cse5 v_prenex_135) .cse2 v_prenex_136) .cse8)))) (or (not (= v_DerPreprocessor_140 (+ (select (store (store (store .cse31 .cse5 (+ v_prenex_135 1)) .cse2 (+ v_prenex_136 1)) .cse32 (select .cse33 .cse32)) .cse2) 1))) (not (= 20 (select (store .cse33 (+ |c_~#queue~0.offset| (* v_DerPreprocessor_140 4)) v_ArrVal_704) .cse2))) (not (= (+ (select .cse34 .cse2) 1) v_prenex_136)) (not (= (+ (select .cse34 .cse5) 1) v_prenex_135)))))))) (not (= 21 .cse3)) (not (= 19 .cse3)) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_DerPreprocessor_184 Int) (v_DerPreprocessor_154 Int) (v_DerPreprocessor_121 Int) (v_DerPreprocessor_214 Int) (v_prenex_129 Int) (v_prenex_60 Int)) (let ((.cse41 (store (store .cse0 .cse1 v_DerPreprocessor_214) .cse10 v_DerPreprocessor_184))) (let ((.cse39 (store .cse41 .cse8 v_prenex_127))) (let ((.cse38 (store (store (store .cse41 .cse5 .cse6) .cse2 .cse7) .cse8 (select (store (store .cse39 .cse5 v_prenex_128) .cse2 v_prenex_129) .cse8)))) (or (not (= (+ (select .cse38 .cse5) 1) v_prenex_128)) (= (select (let ((.cse40 (* v_prenex_129 4))) (store (store (store (store (store .cse39 (+ .cse40 |c_~#queue~0.offset|) v_DerPreprocessor_154) (+ .cse40 |c_~#queue~0.offset| 4) v_DerPreprocessor_121) .cse5 (+ 2 v_prenex_128)) .cse2 (+ 2 v_prenex_129)) (+ .cse40 |c_~#queue~0.offset| 8) v_prenex_60)) .cse2) 20) (not (= (+ (select .cse38 .cse2) 1) v_prenex_129))))))) (< 0 (+ .cse24 1))))))))))))) is different from false [2024-06-14 11:19:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-06-14 11:19:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124249325] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:19:21,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 11:19:21,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2024-06-14 11:19:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704057975] [2024-06-14 11:19:21,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 11:19:21,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-14 11:19:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:19:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-14 11:19:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=305, Unknown=5, NotChecked=120, Total=552 [2024-06-14 11:19:21,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 11:19:21,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 168 flow. Second operand has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 states have internal predecessors, (189), 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) [2024-06-14 11:19:21,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:19:21,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 11:19:21,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:19:29,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 11:19:33,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 11:19:37,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 11:19:41,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 11:19:45,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 11:19:46,377 INFO L124 PetriNetUnfolderBase]: 2089/3480 cut-off events. [2024-06-14 11:19:46,377 INFO L125 PetriNetUnfolderBase]: For 5070/5070 co-relation queries the response was YES. [2024-06-14 11:19:46,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8908 conditions, 3480 events. 2089/3480 cut-off events. For 5070/5070 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 19543 event pairs, 153 based on Foata normal form. 208/3683 useless extension candidates. Maximal degree in co-relation 7128. Up to 585 conditions per place. [2024-06-14 11:19:46,391 INFO L140 encePairwiseOnDemand]: 19/36 looper letters, 172 selfloop transitions, 58 changer transitions 27/261 dead transitions. [2024-06-14 11:19:46,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 261 transitions, 1344 flow [2024-06-14 11:19:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-14 11:19:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-14 11:19:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 357 transitions. [2024-06-14 11:19:46,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6197916666666666 [2024-06-14 11:19:46,396 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 168 flow. Second operand 16 states and 357 transitions. [2024-06-14 11:19:46,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 261 transitions, 1344 flow [2024-06-14 11:19:46,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 261 transitions, 1303 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-14 11:19:46,408 INFO L231 Difference]: Finished difference. Result has 65 places, 91 transitions, 732 flow [2024-06-14 11:19:46,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=732, PETRI_PLACES=65, PETRI_TRANSITIONS=91} [2024-06-14 11:19:46,409 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2024-06-14 11:19:46,409 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 91 transitions, 732 flow [2024-06-14 11:19:46,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 states have internal predecessors, (189), 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) [2024-06-14 11:19:46,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:19:46,410 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:19:46,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-14 11:19:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-06-14 11:19:46,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:19:46,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:19:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1756070442, now seen corresponding path program 4 times [2024-06-14 11:19:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:19:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889977530] [2024-06-14 11:19:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:19:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:19:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:19:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:19:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:19:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889977530] [2024-06-14 11:19:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889977530] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 11:19:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105417387] [2024-06-14 11:19:50,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-14 11:19:50,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:19:50,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:19:50,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:19:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-14 11:19:50,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-14 11:19:50,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 11:19:50,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 62 conjunts are in the unsatisfiable core [2024-06-14 11:19:50,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:19:50,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-14 11:19:50,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2024-06-14 11:19:51,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-06-14 11:19:51,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 119 [2024-06-14 11:19:51,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 124 [2024-06-14 11:19:51,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:19:51,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:19:51,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 129 [2024-06-14 11:19:51,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:19:51,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:19:51,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 147 [2024-06-14 11:19:51,272 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 11:19:51,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 107 [2024-06-14 11:19:51,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 139 [2024-06-14 11:19:51,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 144 [2024-06-14 11:19:51,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 149 [2024-06-14 11:19:51,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 154 [2024-06-14 11:19:51,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:19:51,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 159 [2024-06-14 11:19:51,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 164 [2024-06-14 11:19:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:19:51,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:19:52,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-14 11:19:52,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:19:52,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 31 [2024-06-14 11:19:52,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:19:52,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:19:52,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-14 11:19:52,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-06-14 11:19:52,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 71 [2024-06-14 11:19:52,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:19:52,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-14 11:19:52,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-06-14 11:19:52,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:19:52,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2024-06-14 11:19:53,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:19:53,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-06-14 11:19:53,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:19:53,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:19:53,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-14 11:19:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-06-14 11:19:53,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:20:28,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:20:28,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 145 [2024-06-14 11:21:03,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:03,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-06-14 11:21:03,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-06-14 11:21:04,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-14 11:21:04,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:04,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-14 11:21:04,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-06-14 11:21:04,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-14 11:21:04,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:04,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 52 [2024-06-14 11:21:05,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 52 [2024-06-14 11:21:05,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:05,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 54 [2024-06-14 11:21:05,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:05,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-14 11:21:05,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-06-14 11:21:05,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:05,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-06-14 11:21:09,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse0 .cse2))) (let ((.cse1 (+ (* .cse3 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1090 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_1090) .cse2) 20))) (or (let ((.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (+ .cse3 1)) (.cse21 (select .cse0 (+ |c_~#queue~0.offset| 80))) (.cse4 (+ (select .cse0 .cse8) 1))) (and (not (= 22 .cse3)) (forall ((v_DerPreprocessor_637 Int)) (or (not (= .cse3 17)) (not (= .cse4 v_DerPreprocessor_637)))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int)) (let ((.cse6 (store .cse0 .cse1 v_DerPreprocessor_636))) (or (not (= v_DerPreprocessor_638 .cse5)) (forall ((v_prenex_425 Int) (v_prenex_235 Int) (v_prenex_313 Int) (v_DerPreprocessor_606 Int) (v_DerPreprocessor_518 Int) (v_DerPreprocessor_561 Int) (v_prenex_274 Int) (v_DerPreprocessor_496 Int) (v_prenex_183 Int)) (not (= 20 (select (let ((.cse7 (* v_DerPreprocessor_638 4))) (store (store (store (store (store (store (store (store (store (store (store .cse6 (+ .cse7 |c_~#queue~0.offset|) v_DerPreprocessor_606) (+ .cse7 |c_~#queue~0.offset| 4) v_DerPreprocessor_561) (+ .cse7 |c_~#queue~0.offset| 8) v_prenex_425) (+ .cse7 |c_~#queue~0.offset| 12) v_prenex_313) (+ .cse7 16 |c_~#queue~0.offset|) v_prenex_274) (+ .cse7 |c_~#queue~0.offset| 20) v_DerPreprocessor_518) (+ .cse7 |c_~#queue~0.offset| 24) v_DerPreprocessor_496) (+ .cse7 |c_~#queue~0.offset| 28) v_prenex_235) .cse8 (+ v_DerPreprocessor_637 8)) .cse2 (+ v_DerPreprocessor_638 8)) (+ 32 .cse7 |c_~#queue~0.offset|) v_prenex_183)) .cse2)))) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse6 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1))) (= v_DerPreprocessor_638 13)))) (forall ((v_DerPreprocessor_637 Int)) (or (not (= .cse3 18)) (not (= .cse4 v_DerPreprocessor_637)))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int)) (let ((.cse14 (store .cse0 .cse1 v_DerPreprocessor_636))) (or (not (= v_DerPreprocessor_638 .cse5)) (forall ((v_prenex_315 Int) (v_DerPreprocessor_538 Int) (v_DerPreprocessor_506 Int) (v_DerPreprocessor_617 Int) (v_DerPreprocessor_592 Int) (v_ArrVal_1122 Int) (v_DerPreprocessor_484 Int) (v_DerPreprocessor_552 Int) (v_ArrVal_1105 Int) (v_prenex_272 Int) (v_prenex_316 Int)) (let ((.cse13 (* v_DerPreprocessor_638 4))) (let ((.cse9 (store (store (store .cse14 (+ .cse13 |c_~#queue~0.offset|) v_DerPreprocessor_617) (+ .cse13 |c_~#queue~0.offset| 4) v_DerPreprocessor_592) (+ .cse13 |c_~#queue~0.offset| 8) v_DerPreprocessor_552)) (.cse10 (+ .cse13 |c_~#queue~0.offset| 12))) (let ((.cse11 (store .cse9 .cse10 v_prenex_315)) (.cse12 (+ .cse13 16 |c_~#queue~0.offset|))) (or (= 20 (select (store (store (store .cse9 .cse8 (+ 3 v_DerPreprocessor_637)) .cse2 (+ 3 v_DerPreprocessor_638)) .cse10 v_ArrVal_1105) .cse2)) (= (select (store (store (store (store (store (store (store .cse11 .cse12 v_prenex_272) (+ .cse13 |c_~#queue~0.offset| 20) v_DerPreprocessor_538) (+ .cse13 |c_~#queue~0.offset| 24) v_DerPreprocessor_506) (+ .cse13 |c_~#queue~0.offset| 28) v_DerPreprocessor_484) .cse8 (+ v_DerPreprocessor_637 8)) .cse2 (+ v_DerPreprocessor_638 8)) (+ 32 .cse13 |c_~#queue~0.offset|) v_ArrVal_1122) .cse2) 20) (= 20 (select (store (store (store .cse11 .cse8 (+ v_DerPreprocessor_637 4)) .cse2 (+ v_DerPreprocessor_638 4)) .cse12 v_prenex_316) .cse2))))))) (< v_DerPreprocessor_638 12) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse14 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1))) (= v_DerPreprocessor_638 13)))) (forall ((v_DerPreprocessor_637 Int)) (or (not (= 14 .cse3)) (not (= .cse4 v_DerPreprocessor_637)))) (forall ((v_DerPreprocessor_637 Int)) (or (not (= .cse3 20)) (not (= .cse4 v_DerPreprocessor_637)))) (or (forall ((v_DerPreprocessor_547 Int) (v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_626 Int) (v_DerPreprocessor_638 Int) (v_prenex_239 Int) (v_prenex_424 Int) (v_prenex_238 Int) (v_prenex_423 Int) (v_DerPreprocessor_580 Int) (v_prenex_273 Int) (v_DerPreprocessor_499 Int) (v_DerPreprocessor_522 Int) (v_ArrVal_1108 Int)) (let ((.cse20 (store .cse0 .cse1 v_DerPreprocessor_636)) (.cse19 (* v_DerPreprocessor_638 4))) (let ((.cse15 (store (store (store .cse20 (+ .cse19 |c_~#queue~0.offset|) v_DerPreprocessor_626) (+ .cse19 |c_~#queue~0.offset| 4) v_DerPreprocessor_580) (+ .cse19 |c_~#queue~0.offset| 8) v_prenex_423)) (.cse16 (+ .cse19 |c_~#queue~0.offset| 12))) (let ((.cse17 (store .cse15 .cse16 v_DerPreprocessor_547)) (.cse18 (+ .cse19 16 |c_~#queue~0.offset|))) (or (= 20 (select (store (store (store .cse15 .cse8 (+ 3 v_DerPreprocessor_637)) .cse2 (+ 3 v_DerPreprocessor_638)) .cse16 v_prenex_424) .cse2)) (= 20 (select (store (store (store (store (store (store (store .cse17 .cse18 v_prenex_273) (+ .cse19 |c_~#queue~0.offset| 20) v_DerPreprocessor_522) (+ .cse19 |c_~#queue~0.offset| 24) v_DerPreprocessor_499) (+ .cse19 |c_~#queue~0.offset| 28) v_prenex_239) .cse8 (+ v_DerPreprocessor_637 8)) .cse2 (+ v_DerPreprocessor_638 8)) (+ 32 .cse19 |c_~#queue~0.offset|) v_prenex_238) .cse2)) (not (= v_DerPreprocessor_638 .cse5)) (= (select (store (store (store .cse17 .cse8 (+ v_DerPreprocessor_637 4)) .cse2 (+ v_DerPreprocessor_638 4)) .cse18 v_ArrVal_1108) .cse2) 20) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse20 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1))) (= v_DerPreprocessor_638 13)))))) (< 0 (+ .cse21 1))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int)) (let ((.cse22 (store .cse0 .cse1 v_DerPreprocessor_636))) (or (forall ((v_prenex_422 Int) (v_DerPreprocessor_609 Int) (v_prenex_320 Int) (v_DerPreprocessor_595 Int)) (not (= (select (let ((.cse23 (* v_DerPreprocessor_638 4))) (store (store (store (store (store (store .cse22 (+ .cse23 |c_~#queue~0.offset|) v_DerPreprocessor_609) (+ .cse23 |c_~#queue~0.offset| 4) v_DerPreprocessor_595) (+ .cse23 |c_~#queue~0.offset| 8) v_prenex_422) .cse8 (+ 3 v_DerPreprocessor_637)) .cse2 (+ 3 v_DerPreprocessor_638)) (+ .cse23 |c_~#queue~0.offset| 12) v_prenex_320)) .cse2) 20))) (not (= v_DerPreprocessor_638 .cse5)) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse22 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1)))))) (forall ((v_DerPreprocessor_637 Int)) (or (not (= .cse3 13)) (not (= .cse4 v_DerPreprocessor_637)))) (forall ((v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int)) (or (< 0 (+ v_DerPreprocessor_638 10)) (not (= v_DerPreprocessor_638 .cse5)) (not (= .cse4 v_DerPreprocessor_637)))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int)) (let ((.cse24 (store .cse0 .cse1 v_DerPreprocessor_636))) (or (not (= v_DerPreprocessor_638 .cse5)) (forall ((v_DerPreprocessor_603 Int) (v_prenex_421 Int) (v_DerPreprocessor_571 Int) (v_DerPreprocessor_494 Int) (v_prenex_271 Int) (v_ArrVal_1118 Int) (v_DerPreprocessor_513 Int) (v_prenex_317 Int)) (not (= (select (let ((.cse25 (* v_DerPreprocessor_638 4))) (store (store (store (store (store (store (store (store (store (store .cse24 (+ .cse25 |c_~#queue~0.offset|) v_DerPreprocessor_603) (+ .cse25 |c_~#queue~0.offset| 4) v_DerPreprocessor_571) (+ .cse25 |c_~#queue~0.offset| 8) v_prenex_421) (+ .cse25 |c_~#queue~0.offset| 12) v_prenex_317) (+ .cse25 16 |c_~#queue~0.offset|) v_prenex_271) (+ .cse25 |c_~#queue~0.offset| 20) v_DerPreprocessor_513) (+ .cse25 |c_~#queue~0.offset| 24) v_DerPreprocessor_494) .cse8 (+ 7 v_DerPreprocessor_637)) .cse2 (+ 7 v_DerPreprocessor_638)) (+ .cse25 |c_~#queue~0.offset| 28) v_ArrVal_1118)) .cse2) 20))) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse24 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1)))))) (not (= 21 .cse3)) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int)) (let ((.cse29 (store .cse0 .cse1 v_DerPreprocessor_636))) (or (not (= v_DerPreprocessor_638 .cse5)) (forall ((v_prenex_314 Int) (v_prenex_420 Int) (v_prenex_275 Int) (v_prenex_419 Int) (v_DerPreprocessor_631 Int) (v_DerPreprocessor_567 Int)) (let ((.cse28 (* v_DerPreprocessor_638 4))) (let ((.cse26 (store (store (store .cse29 (+ .cse28 |c_~#queue~0.offset|) v_DerPreprocessor_631) (+ .cse28 |c_~#queue~0.offset| 4) v_DerPreprocessor_567) (+ .cse28 |c_~#queue~0.offset| 8) v_prenex_419)) (.cse27 (+ .cse28 |c_~#queue~0.offset| 12))) (or (not (= (select (store (store (store (store .cse26 .cse27 v_prenex_314) .cse8 (+ v_DerPreprocessor_637 4)) .cse2 (+ v_DerPreprocessor_638 4)) (+ .cse28 16 |c_~#queue~0.offset|) v_prenex_275) .cse2) 20)) (= (select (store (store (store .cse26 .cse8 (+ 3 v_DerPreprocessor_637)) .cse2 (+ 3 v_DerPreprocessor_638)) .cse27 v_prenex_420) .cse2) 20))))) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse29 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1)))))) (or (forall ((v_DerPreprocessor_525 Int) (v_DerPreprocessor_503 Int) (v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_638 Int) (v_DerPreprocessor_619 Int) (v_prenex_417 Int) (v_prenex_318 Int) (v_prenex_319 Int) (v_prenex_418 Int) (v_prenex_237 Int) (v_prenex_236 Int) (v_DerPreprocessor_541 Int) (v_DerPreprocessor_599 Int)) (let ((.cse33 (store .cse0 .cse1 v_DerPreprocessor_636)) (.cse32 (* v_DerPreprocessor_638 4))) (let ((.cse34 (store (store (store .cse33 (+ .cse32 |c_~#queue~0.offset|) v_DerPreprocessor_619) (+ .cse32 |c_~#queue~0.offset| 4) v_DerPreprocessor_599) (+ .cse32 |c_~#queue~0.offset| 8) v_prenex_417)) (.cse35 (+ .cse32 |c_~#queue~0.offset| 12))) (let ((.cse30 (store .cse34 .cse35 v_prenex_318)) (.cse31 (+ .cse32 16 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse30 .cse8 (+ v_DerPreprocessor_637 4)) .cse2 (+ v_DerPreprocessor_638 4)) .cse31 v_prenex_319) .cse2) 20) (not (= v_DerPreprocessor_638 .cse5)) (= (select (store (store (store (store (store (store (store .cse30 .cse31 v_DerPreprocessor_541) (+ .cse32 |c_~#queue~0.offset| 20) v_DerPreprocessor_525) (+ .cse32 |c_~#queue~0.offset| 24) v_DerPreprocessor_503) (+ .cse32 |c_~#queue~0.offset| 28) v_prenex_237) .cse8 (+ v_DerPreprocessor_637 8)) .cse2 (+ v_DerPreprocessor_638 8)) (+ 32 .cse32 |c_~#queue~0.offset|) v_prenex_236) .cse2) 20) (not (= v_DerPreprocessor_637 (+ (select (store .cse0 .cse1 (select (store (store .cse33 .cse8 v_DerPreprocessor_637) .cse2 v_DerPreprocessor_638) .cse1)) .cse8) 1))) (= v_DerPreprocessor_638 13) (= 20 (select (store (store (store .cse34 .cse8 (+ 3 v_DerPreprocessor_637)) .cse2 (+ 3 v_DerPreprocessor_638)) .cse35 v_prenex_418) .cse2))))))) (< .cse21 21)) (forall ((v_DerPreprocessor_637 Int)) (or (not (= 19 .cse3)) (not (= .cse4 v_DerPreprocessor_637))))))) (forall ((v_ArrVal_1090 Int)) (= (select (store .cse0 .cse1 v_ArrVal_1090) .cse2) 20))))))) is different from false [2024-06-14 11:21:10,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:10,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 125 [2024-06-14 11:21:10,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:10,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 177 [2024-06-14 11:21:10,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:10,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 107 [2024-06-14 11:21:10,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 175 [2024-06-14 11:21:10,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 142 [2024-06-14 11:21:10,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 142 [2024-06-14 11:21:10,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:21:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 95 [2024-06-14 11:21:14,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse14 .cse3))) (let ((.cse12 (+ .cse0 1)) (.cse22 (select .cse14 (+ |c_~#queue~0.offset| 80))) (.cse15 (+ (* .cse0 4) |c_~#queue~0.offset|)) (.cse5 (+ (select .cse14 .cse2) 1))) (and (not (= 22 .cse0)) (forall ((v_DerPreprocessor_647 Int) (v_DerPreprocessor_636 Int) (v_DerPreprocessor_538 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_648 Int) (v_DerPreprocessor_649 Int) (v_DerPreprocessor_506 Int) (v_DerPreprocessor_617 Int) (v_ArrVal_1090 Int) (v_prenex_316 Int) (v_prenex_315 Int) (v_DerPreprocessor_592 Int) (v_ArrVal_1122 Int) (v_DerPreprocessor_484 Int) (v_DerPreprocessor_552 Int) (v_ArrVal_1105 Int) (v_prenex_272 Int)) (let ((.cse10 (* v_DerPreprocessor_649 4))) (let ((.cse13 (store .cse14 .cse15 v_DerPreprocessor_647)) (.cse9 (+ |c_~#queue~0.offset| .cse10))) (let ((.cse11 (store .cse13 .cse9 v_DerPreprocessor_636))) (let ((.cse1 (store (store (store .cse11 (+ |c_~#queue~0.offset| .cse10 4) v_DerPreprocessor_617) (+ |c_~#queue~0.offset| .cse10 8) v_DerPreprocessor_592) (+ |c_~#queue~0.offset| .cse10 12) v_DerPreprocessor_552)) (.cse4 (+ 16 |c_~#queue~0.offset| .cse10))) (let ((.cse6 (store .cse1 .cse4 v_prenex_315)) (.cse7 (+ |c_~#queue~0.offset| .cse10 20)) (.cse8 (store (store .cse13 .cse2 v_DerPreprocessor_648) .cse3 v_DerPreprocessor_649))) (or (= (select (store (store (store .cse1 .cse2 (+ 3 v_DerPreprocessor_637)) .cse3 (+ v_DerPreprocessor_649 4)) .cse4 v_ArrVal_1105) .cse3) 20) (not (= .cse5 v_DerPreprocessor_648)) (= (select (store (store (store .cse6 .cse2 (+ v_DerPreprocessor_637 4)) .cse3 (+ 5 v_DerPreprocessor_649)) .cse7 v_prenex_316) .cse3) 20) (= v_DerPreprocessor_649 12) (= (select (store .cse8 .cse9 v_ArrVal_1090) .cse3) 20) (= 20 (select (store (store (store (store (store (store (store .cse6 .cse7 v_prenex_272) (+ |c_~#queue~0.offset| .cse10 24) v_DerPreprocessor_538) (+ |c_~#queue~0.offset| .cse10 28) v_DerPreprocessor_506) (+ 32 |c_~#queue~0.offset| .cse10) v_DerPreprocessor_484) .cse2 (+ v_DerPreprocessor_637 8)) .cse3 (+ 9 v_DerPreprocessor_649)) (+ |c_~#queue~0.offset| .cse10 36) v_ArrVal_1122) .cse3)) (< v_DerPreprocessor_649 11) (not (= v_DerPreprocessor_637 (+ (select (store .cse8 .cse9 (select (store (store .cse11 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_649 1)) .cse9)) .cse2) 1))) (not (= v_DerPreprocessor_649 .cse12))))))))) (forall ((v_DerPreprocessor_547 Int) (v_DerPreprocessor_636 Int) (v_DerPreprocessor_626 Int) (v_DerPreprocessor_637 Int) (v_ArrVal_1090 Int) (v_prenex_239 Int) (v_prenex_424 Int) (v_prenex_238 Int) (v_prenex_423 Int) (v_DerPreprocessor_580 Int) (v_DerPreprocessor_660 Int) (v_prenex_273 Int) (v_DerPreprocessor_661 Int) (v_DerPreprocessor_662 Int) (v_DerPreprocessor_499 Int) (v_DerPreprocessor_522 Int) (v_ArrVal_1108 Int)) (let ((.cse23 (* v_DerPreprocessor_662 4))) (let ((.cse25 (store .cse14 .cse15 v_DerPreprocessor_660)) (.cse19 (+ .cse23 |c_~#queue~0.offset|))) (let ((.cse24 (store .cse25 .cse19 v_DerPreprocessor_636))) (let ((.cse16 (store (store (store .cse24 (+ .cse23 |c_~#queue~0.offset| 4) v_DerPreprocessor_626) (+ .cse23 |c_~#queue~0.offset| 8) v_DerPreprocessor_580) (+ .cse23 |c_~#queue~0.offset| 12) v_prenex_423)) (.cse17 (+ .cse23 16 |c_~#queue~0.offset|))) (let ((.cse20 (store .cse16 .cse17 v_DerPreprocessor_547)) (.cse21 (+ .cse23 |c_~#queue~0.offset| 20)) (.cse18 (store (store .cse25 .cse2 v_DerPreprocessor_661) .cse3 v_DerPreprocessor_662))) (or (= (select (store (store (store .cse16 .cse2 (+ 3 v_DerPreprocessor_637)) .cse3 (+ v_DerPreprocessor_662 4)) .cse17 v_prenex_424) .cse3) 20) (= 20 (select (store .cse18 .cse19 v_ArrVal_1090) .cse3)) (= (select (store (store (store .cse20 .cse2 (+ v_DerPreprocessor_637 4)) .cse3 (+ 5 v_DerPreprocessor_662)) .cse21 v_ArrVal_1108) .cse3) 20) (not (= v_DerPreprocessor_662 .cse12)) (not (= .cse5 v_DerPreprocessor_661)) (< 0 (+ .cse22 1)) (= (select (store (store (store (store (store (store (store .cse20 .cse21 v_prenex_273) (+ .cse23 |c_~#queue~0.offset| 24) v_DerPreprocessor_522) (+ .cse23 |c_~#queue~0.offset| 28) v_DerPreprocessor_499) (+ .cse23 32 |c_~#queue~0.offset|) v_prenex_239) .cse2 (+ v_DerPreprocessor_637 8)) .cse3 (+ 9 v_DerPreprocessor_662)) (+ .cse23 |c_~#queue~0.offset| 36) v_prenex_238) .cse3) 20) (= v_DerPreprocessor_662 12) (not (= (+ (select (store .cse18 .cse19 (select (store (store .cse24 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_662 1)) .cse19)) .cse2) 1) v_DerPreprocessor_637))))))))) (forall ((v_DerPreprocessor_668 Int) (v_prenex_314 Int) (v_DerPreprocessor_669 Int) (v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_prenex_420 Int) (v_prenex_275 Int) (v_prenex_419 Int) (v_DerPreprocessor_631 Int) (v_DerPreprocessor_567 Int) (v_DerPreprocessor_667 Int)) (let ((.cse31 (* v_DerPreprocessor_669 4))) (let ((.cse28 (store .cse14 .cse15 v_DerPreprocessor_667)) (.cse29 (+ .cse31 |c_~#queue~0.offset|))) (let ((.cse30 (store .cse28 .cse29 v_DerPreprocessor_636))) (let ((.cse26 (store (store (store .cse30 (+ .cse31 |c_~#queue~0.offset| 4) v_DerPreprocessor_631) (+ .cse31 |c_~#queue~0.offset| 8) v_DerPreprocessor_567) (+ .cse31 |c_~#queue~0.offset| 12) v_prenex_419)) (.cse27 (+ .cse31 16 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse26 .cse2 (+ 3 v_DerPreprocessor_637)) .cse3 (+ v_DerPreprocessor_669 4)) .cse27 v_prenex_420) .cse3) 20) (not (= v_DerPreprocessor_669 .cse12)) (not (= v_DerPreprocessor_637 (+ (select (store (store (store .cse28 .cse2 v_DerPreprocessor_668) .cse3 v_DerPreprocessor_669) .cse29 (select (store (store .cse30 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_669 1)) .cse29)) .cse2) 1))) (not (= 20 (select (store (store (store (store .cse26 .cse27 v_prenex_314) .cse2 (+ v_DerPreprocessor_637 4)) .cse3 (+ 5 v_DerPreprocessor_669)) (+ .cse31 |c_~#queue~0.offset| 20) v_prenex_275) .cse3))) (not (= .cse5 v_DerPreprocessor_668)))))))) (forall ((v_DerPreprocessor_636 Int) (v_prenex_422 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_681 Int) (v_DerPreprocessor_609 Int) (v_prenex_320 Int) (v_DerPreprocessor_682 Int) (v_DerPreprocessor_683 Int) (v_DerPreprocessor_595 Int)) (let ((.cse33 (* v_DerPreprocessor_683 4))) (let ((.cse34 (store .cse14 .cse15 v_DerPreprocessor_681)) (.cse35 (+ .cse33 |c_~#queue~0.offset|))) (let ((.cse32 (store .cse34 .cse35 v_DerPreprocessor_636))) (or (not (= .cse5 v_DerPreprocessor_682)) (not (= (select (store (store (store (store (store (store .cse32 (+ .cse33 |c_~#queue~0.offset| 4) v_DerPreprocessor_609) (+ .cse33 |c_~#queue~0.offset| 8) v_DerPreprocessor_595) (+ .cse33 |c_~#queue~0.offset| 12) v_prenex_422) .cse2 (+ 3 v_DerPreprocessor_637)) .cse3 (+ v_DerPreprocessor_683 4)) (+ .cse33 16 |c_~#queue~0.offset|) v_prenex_320) .cse3) 20)) (not (= v_DerPreprocessor_683 .cse12)) (not (= v_DerPreprocessor_637 (+ (select (store (store (store .cse34 .cse2 v_DerPreprocessor_682) .cse3 v_DerPreprocessor_683) .cse35 (select (store (store .cse32 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_683 1)) .cse35)) .cse2) 1)))))))) (forall ((v_DerPreprocessor_664 Int)) (or (not (= .cse0 13)) (not (= .cse5 v_DerPreprocessor_664)))) (not (= .cse0 20)) (forall ((v_DerPreprocessor_701 Int) (v_DerPreprocessor_702 Int) (v_ArrVal_1090 Int) (v_DerPreprocessor_700 Int)) (or (not (= .cse5 v_DerPreprocessor_701)) (not (= (select (store (store (store (store .cse14 .cse15 v_DerPreprocessor_700) .cse2 v_DerPreprocessor_701) .cse3 v_DerPreprocessor_702) (+ (* v_DerPreprocessor_702 4) |c_~#queue~0.offset|) v_ArrVal_1090) .cse3) 20)) (not (= v_DerPreprocessor_702 .cse12)))) (forall ((v_DerPreprocessor_656 Int)) (or (not (= .cse0 12)) (not (= .cse5 v_DerPreprocessor_656)))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_606 Int) (v_DerPreprocessor_518 Int) (v_prenex_425 Int) (v_prenex_235 Int) (v_prenex_313 Int) (v_DerPreprocessor_561 Int) (v_prenex_274 Int) (v_DerPreprocessor_496 Int) (v_prenex_183 Int) (v_DerPreprocessor_697 Int) (v_DerPreprocessor_698 Int) (v_DerPreprocessor_699 Int)) (let ((.cse37 (* v_DerPreprocessor_699 4))) (let ((.cse38 (store .cse14 .cse15 v_DerPreprocessor_697)) (.cse39 (+ |c_~#queue~0.offset| .cse37))) (let ((.cse36 (store .cse38 .cse39 v_DerPreprocessor_636))) (or (not (= 20 (select (store (store (store (store (store (store (store (store (store (store (store .cse36 (+ |c_~#queue~0.offset| .cse37 4) v_DerPreprocessor_606) (+ |c_~#queue~0.offset| 8 .cse37) v_DerPreprocessor_561) (+ |c_~#queue~0.offset| 12 .cse37) v_prenex_425) (+ 16 |c_~#queue~0.offset| .cse37) v_prenex_313) (+ |c_~#queue~0.offset| 20 .cse37) v_prenex_274) (+ |c_~#queue~0.offset| .cse37 24) v_DerPreprocessor_518) (+ |c_~#queue~0.offset| .cse37 28) v_DerPreprocessor_496) (+ 32 |c_~#queue~0.offset| .cse37) v_prenex_235) .cse2 (+ v_DerPreprocessor_637 8)) .cse3 (+ 9 v_DerPreprocessor_699)) (+ |c_~#queue~0.offset| 36 .cse37) v_prenex_183) .cse3))) (not (= (+ (select (store (store (store .cse38 .cse2 v_DerPreprocessor_698) .cse3 v_DerPreprocessor_699) .cse39 (select (store (store .cse36 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_699 1)) .cse39)) .cse2) 1) v_DerPreprocessor_637)) (not (= v_DerPreprocessor_699 .cse12)) (= v_DerPreprocessor_699 12) (not (= .cse5 v_DerPreprocessor_698))))))) (forall ((v_DerPreprocessor_690 Int) (v_DerPreprocessor_691 Int)) (or (< 0 (+ v_DerPreprocessor_691 11)) (not (= v_DerPreprocessor_691 .cse12)) (not (= .cse5 v_DerPreprocessor_690)))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_603 Int) (v_DerPreprocessor_637 Int) (v_prenex_317 Int) (v_prenex_421 Int) (v_DerPreprocessor_571 Int) (v_DerPreprocessor_494 Int) (v_prenex_271 Int) (v_DerPreprocessor_686 Int) (v_ArrVal_1118 Int) (v_DerPreprocessor_687 Int) (v_DerPreprocessor_688 Int) (v_DerPreprocessor_513 Int)) (let ((.cse41 (* v_DerPreprocessor_688 4))) (let ((.cse42 (store .cse14 .cse15 v_DerPreprocessor_686)) (.cse43 (+ .cse41 |c_~#queue~0.offset|))) (let ((.cse40 (store .cse42 .cse43 v_DerPreprocessor_636))) (or (not (= .cse5 v_DerPreprocessor_687)) (not (= 20 (select (store (store (store (store (store (store (store (store (store (store .cse40 (+ .cse41 |c_~#queue~0.offset| 4) v_DerPreprocessor_603) (+ .cse41 |c_~#queue~0.offset| 8) v_DerPreprocessor_571) (+ .cse41 |c_~#queue~0.offset| 12) v_prenex_421) (+ 16 .cse41 |c_~#queue~0.offset|) v_prenex_317) (+ .cse41 |c_~#queue~0.offset| 20) v_prenex_271) (+ .cse41 |c_~#queue~0.offset| 24) v_DerPreprocessor_513) (+ .cse41 |c_~#queue~0.offset| 28) v_DerPreprocessor_494) .cse2 (+ 7 v_DerPreprocessor_637)) .cse3 (+ v_DerPreprocessor_688 8)) (+ 32 .cse41 |c_~#queue~0.offset|) v_ArrVal_1118) .cse3))) (not (= v_DerPreprocessor_688 .cse12)) (not (= (+ (select (store (store (store .cse42 .cse2 v_DerPreprocessor_687) .cse3 v_DerPreprocessor_688) .cse43 (select (store (store .cse40 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_688 1)) .cse43)) .cse2) 1) v_DerPreprocessor_637))))))) (forall ((v_DerPreprocessor_642 Int)) (or (not (= .cse5 v_DerPreprocessor_642)) (not (= 16 .cse0)))) (forall ((v_DerPreprocessor_676 Int)) (or (not (= .cse0 17)) (not (= .cse5 v_DerPreprocessor_676)))) (forall ((v_DerPreprocessor_525 Int) (v_DerPreprocessor_503 Int) (v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_619 Int) (v_prenex_417 Int) (v_prenex_318 Int) (v_prenex_319 Int) (v_ArrVal_1090 Int) (v_prenex_418 Int) (v_prenex_237 Int) (v_prenex_236 Int) (v_DerPreprocessor_671 Int) (v_DerPreprocessor_672 Int) (v_DerPreprocessor_673 Int) (v_DerPreprocessor_541 Int) (v_DerPreprocessor_599 Int)) (let ((.cse49 (* v_DerPreprocessor_673 4))) (let ((.cse52 (store .cse14 .cse15 v_DerPreprocessor_671)) (.cse45 (+ .cse49 |c_~#queue~0.offset|))) (let ((.cse48 (store .cse52 .cse45 v_DerPreprocessor_636))) (let ((.cse50 (store (store (store .cse48 (+ .cse49 |c_~#queue~0.offset| 4) v_DerPreprocessor_619) (+ .cse49 |c_~#queue~0.offset| 8) v_DerPreprocessor_599) (+ .cse49 |c_~#queue~0.offset| 12) v_prenex_417)) (.cse51 (+ .cse49 16 |c_~#queue~0.offset|))) (let ((.cse44 (store (store .cse52 .cse2 v_DerPreprocessor_672) .cse3 v_DerPreprocessor_673)) (.cse46 (store .cse50 .cse51 v_prenex_318)) (.cse47 (+ .cse49 |c_~#queue~0.offset| 20))) (or (= 20 (select (store .cse44 .cse45 v_ArrVal_1090) .cse3)) (= (select (store (store (store .cse46 .cse2 (+ v_DerPreprocessor_637 4)) .cse3 (+ 5 v_DerPreprocessor_673)) .cse47 v_prenex_319) .cse3) 20) (not (= v_DerPreprocessor_673 .cse12)) (= v_DerPreprocessor_673 12) (not (= (+ (select (store .cse44 .cse45 (select (store (store .cse48 .cse2 v_DerPreprocessor_637) .cse3 (+ v_DerPreprocessor_673 1)) .cse45)) .cse2) 1) v_DerPreprocessor_637)) (= (select (store (store (store (store (store (store (store .cse46 .cse47 v_DerPreprocessor_541) (+ .cse49 |c_~#queue~0.offset| 24) v_DerPreprocessor_525) (+ .cse49 |c_~#queue~0.offset| 28) v_DerPreprocessor_503) (+ .cse49 32 |c_~#queue~0.offset|) v_prenex_237) .cse2 (+ v_DerPreprocessor_637 8)) .cse3 (+ 9 v_DerPreprocessor_673)) (+ .cse49 |c_~#queue~0.offset| 36) v_prenex_236) .cse3) 20) (= (select (store (store (store .cse50 .cse2 (+ 3 v_DerPreprocessor_637)) .cse3 (+ v_DerPreprocessor_673 4)) .cse51 v_prenex_418) .cse3) 20) (not (= .cse5 v_DerPreprocessor_672)) (< .cse22 21)))))))) (not (= 21 .cse0)) (forall ((v_DerPreprocessor_652 Int)) (or (not (= .cse0 18)) (not (= .cse5 v_DerPreprocessor_652)))))))) is different from false [2024-06-14 11:21:15,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-14 11:21:19,333 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (select .cse0 .cse4))) (let ((.cse1 (+ (* .cse12 4) |c_~#queue~0.offset|))) (and (or (let ((.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse23 (select .cse0 (+ |c_~#queue~0.offset| 80))) (.cse5 (+ (select .cse0 .cse3) 1))) (and (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (let ((.cse2 (store .cse0 .cse1 v_DerPreprocessor_704))) (or (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse2 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (not (= .cse5 v_DerPreprocessor_705)) (forall ((v_prenex_556 Int) (v_prenex_314 Int) (v_prenex_557 Int) (v_prenex_420 Int) (v_prenex_275 Int) (v_prenex_419 Int) (v_DerPreprocessor_631 Int) (v_DerPreprocessor_567 Int) (v_DerPreprocessor_667 Int)) (let ((.cse8 (* v_DerPreprocessor_706 4))) (let ((.cse9 (store .cse2 (+ .cse8 |c_~#queue~0.offset|) v_DerPreprocessor_667)) (.cse10 (+ .cse8 |c_~#queue~0.offset| 4))) (let ((.cse11 (store .cse9 .cse10 v_prenex_556))) (let ((.cse6 (store (store (store .cse11 (+ .cse8 |c_~#queue~0.offset| 8) v_DerPreprocessor_631) (+ .cse8 |c_~#queue~0.offset| 12) v_DerPreprocessor_567) (+ .cse8 16 |c_~#queue~0.offset|) v_prenex_419)) (.cse7 (+ .cse8 |c_~#queue~0.offset| 20))) (or (not (= (select (store (store (store (store .cse6 .cse7 v_prenex_314) .cse3 (+ v_prenex_557 4)) .cse4 (+ v_DerPreprocessor_706 6)) (+ .cse8 |c_~#queue~0.offset| 24) v_prenex_275) .cse4) 20)) (= (select (store (store (store .cse6 .cse3 (+ 3 v_prenex_557)) .cse4 (+ 5 v_DerPreprocessor_706)) .cse7 v_prenex_420) .cse4) 20) (not (= v_prenex_557 (+ (select (store (store (store .cse9 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)) .cse10 (select (store (store .cse11 .cse3 v_prenex_557) .cse4 (+ 2 v_DerPreprocessor_706)) .cse10)) .cse3) 1)))))))))))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= 15 (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 16) .cse1)) .cse4))) (not (= .cse5 v_DerPreprocessor_705)))) (not (= 22 .cse12)) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 12) .cse1)) .cse4) 11)) (not (= .cse5 v_DerPreprocessor_705)))) (or (forall ((v_DerPreprocessor_525 Int) (v_DerPreprocessor_503 Int) (v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int) (v_DerPreprocessor_619 Int) (v_prenex_417 Int) (v_prenex_318 Int) (v_prenex_319 Int) (v_prenex_418 Int) (v_prenex_237 Int) (v_prenex_236 Int) (v_prenex_552 Int) (v_prenex_553 Int) (v_prenex_551 Int) (v_DerPreprocessor_671 Int) (v_DerPreprocessor_541 Int) (v_DerPreprocessor_599 Int)) (let ((.cse18 (store .cse0 .cse1 v_DerPreprocessor_704)) (.cse15 (* v_DerPreprocessor_706 4))) (let ((.cse22 (store .cse18 (+ .cse15 |c_~#queue~0.offset|) v_DerPreprocessor_671)) (.cse20 (+ .cse15 |c_~#queue~0.offset| 4))) (let ((.cse21 (store .cse22 .cse20 v_prenex_551))) (let ((.cse16 (store (store (store .cse21 (+ .cse15 |c_~#queue~0.offset| 8) v_DerPreprocessor_619) (+ .cse15 |c_~#queue~0.offset| 12) v_DerPreprocessor_599) (+ .cse15 16 |c_~#queue~0.offset|) v_prenex_417)) (.cse17 (+ .cse15 |c_~#queue~0.offset| 20))) (let ((.cse13 (store .cse16 .cse17 v_prenex_318)) (.cse14 (+ .cse15 |c_~#queue~0.offset| 24)) (.cse19 (store (store .cse22 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)))) (or (= (select (store (store (store (store (store (store (store .cse13 .cse14 v_DerPreprocessor_541) (+ .cse15 |c_~#queue~0.offset| 28) v_DerPreprocessor_525) (+ .cse15 32 |c_~#queue~0.offset|) v_DerPreprocessor_503) (+ .cse15 |c_~#queue~0.offset| 36) v_prenex_237) .cse3 (+ v_prenex_552 8)) .cse4 (+ v_DerPreprocessor_706 10)) (+ .cse15 40 |c_~#queue~0.offset|) v_prenex_236) .cse4) 20) (= (select (store (store (store .cse16 .cse3 (+ 3 v_prenex_552)) .cse4 (+ 5 v_DerPreprocessor_706)) .cse17 v_prenex_418) .cse4) 20) (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse18 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (= 20 (select (store .cse19 .cse20 v_prenex_553) .cse4)) (not (= .cse5 v_DerPreprocessor_705)) (= (select (store (store (store .cse13 .cse3 (+ v_prenex_552 4)) .cse4 (+ v_DerPreprocessor_706 6)) .cse14 v_prenex_319) .cse4) 20) (= v_DerPreprocessor_706 11) (not (= (+ (select (store .cse19 .cse20 (select (store (store .cse21 .cse3 v_prenex_552) .cse4 (+ 2 v_DerPreprocessor_706)) .cse20)) .cse3) 1) v_prenex_552))))))))) (< .cse23 21)) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (let ((.cse28 (store .cse0 .cse1 v_DerPreprocessor_704))) (or (forall ((v_DerPreprocessor_603 Int) (v_prenex_421 Int) (v_prenex_550 Int) (v_DerPreprocessor_571 Int) (v_DerPreprocessor_494 Int) (v_prenex_271 Int) (v_prenex_549 Int) (v_DerPreprocessor_686 Int) (v_ArrVal_1118 Int) (v_DerPreprocessor_513 Int) (v_prenex_317 Int)) (let ((.cse27 (* v_DerPreprocessor_706 4))) (let ((.cse24 (store .cse28 (+ .cse27 |c_~#queue~0.offset|) v_DerPreprocessor_686)) (.cse25 (+ .cse27 |c_~#queue~0.offset| 4))) (let ((.cse26 (store .cse24 .cse25 v_prenex_549))) (or (not (= (+ (select (store (store (store .cse24 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)) .cse25 (select (store (store .cse26 .cse3 v_prenex_550) .cse4 (+ 2 v_DerPreprocessor_706)) .cse25)) .cse3) 1) v_prenex_550)) (not (= 20 (select (store (store (store (store (store (store (store (store (store (store .cse26 (+ .cse27 |c_~#queue~0.offset| 8) v_DerPreprocessor_603) (+ .cse27 |c_~#queue~0.offset| 12) v_DerPreprocessor_571) (+ .cse27 16 |c_~#queue~0.offset|) v_prenex_421) (+ .cse27 |c_~#queue~0.offset| 20) v_prenex_317) (+ .cse27 |c_~#queue~0.offset| 24) v_prenex_271) (+ .cse27 |c_~#queue~0.offset| 28) v_DerPreprocessor_513) (+ .cse27 32 |c_~#queue~0.offset|) v_DerPreprocessor_494) .cse3 (+ 7 v_prenex_550)) .cse4 (+ 9 v_DerPreprocessor_706)) (+ .cse27 |c_~#queue~0.offset| 36) v_ArrVal_1118) .cse4)))))))) (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse28 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (not (= .cse5 v_DerPreprocessor_705))))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (let ((.cse29 (store .cse0 .cse1 v_DerPreprocessor_704))) (or (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse29 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (not (= .cse5 v_DerPreprocessor_705)) (forall ((v_DerPreprocessor_647 Int) (v_DerPreprocessor_538 Int) (v_DerPreprocessor_506 Int) (v_DerPreprocessor_617 Int) (v_ArrVal_1090 Int) (v_prenex_316 Int) (v_prenex_315 Int) (v_prenex_543 Int) (v_prenex_544 Int) (v_DerPreprocessor_592 Int) (v_ArrVal_1122 Int) (v_DerPreprocessor_484 Int) (v_DerPreprocessor_552 Int) (v_ArrVal_1105 Int) (v_prenex_272 Int)) (let ((.cse37 (* v_DerPreprocessor_706 4))) (let ((.cse38 (store .cse29 (+ .cse37 |c_~#queue~0.offset|) v_DerPreprocessor_647)) (.cse31 (+ .cse37 |c_~#queue~0.offset| 4))) (let ((.cse32 (store .cse38 .cse31 v_prenex_543))) (let ((.cse35 (store (store (store .cse32 (+ .cse37 |c_~#queue~0.offset| 8) v_DerPreprocessor_617) (+ .cse37 |c_~#queue~0.offset| 12) v_DerPreprocessor_592) (+ .cse37 16 |c_~#queue~0.offset|) v_DerPreprocessor_552)) (.cse36 (+ .cse37 |c_~#queue~0.offset| 20))) (let ((.cse30 (store (store .cse38 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1))) (.cse33 (store .cse35 .cse36 v_prenex_315)) (.cse34 (+ .cse37 |c_~#queue~0.offset| 24))) (or (= (select (store .cse30 .cse31 v_ArrVal_1090) .cse4) 20) (not (= v_prenex_544 (+ (select (store .cse30 .cse31 (select (store (store .cse32 .cse3 v_prenex_544) .cse4 (+ 2 v_DerPreprocessor_706)) .cse31)) .cse3) 1))) (= (select (store (store (store .cse33 .cse3 (+ v_prenex_544 4)) .cse4 (+ v_DerPreprocessor_706 6)) .cse34 v_prenex_316) .cse4) 20) (= (select (store (store (store .cse35 .cse3 (+ 3 v_prenex_544)) .cse4 (+ 5 v_DerPreprocessor_706)) .cse36 v_ArrVal_1105) .cse4) 20) (= (select (store (store (store (store (store (store (store .cse33 .cse34 v_prenex_272) (+ .cse37 |c_~#queue~0.offset| 28) v_DerPreprocessor_538) (+ .cse37 32 |c_~#queue~0.offset|) v_DerPreprocessor_506) (+ .cse37 |c_~#queue~0.offset| 36) v_DerPreprocessor_484) .cse3 (+ v_prenex_544 8)) .cse4 (+ v_DerPreprocessor_706 10)) (+ .cse37 40 |c_~#queue~0.offset|) v_ArrVal_1122) .cse4) 20)))))))) (< v_DerPreprocessor_706 10) (= v_DerPreprocessor_706 11)))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= 16 (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 17) .cse1)) .cse4))) (not (= .cse5 v_DerPreprocessor_705)))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= .cse5 v_DerPreprocessor_705)) (not (= 20 (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 21) .cse1)) .cse4))))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (let ((.cse39 (store .cse0 .cse1 v_DerPreprocessor_704))) (or (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse39 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (not (= .cse5 v_DerPreprocessor_705)) (forall ((v_prenex_545 Int) (v_DerPreprocessor_700 Int)) (not (= (select (let ((.cse40 (* v_DerPreprocessor_706 4))) (store (store (store (store .cse39 (+ .cse40 |c_~#queue~0.offset|) v_DerPreprocessor_700) .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)) (+ .cse40 |c_~#queue~0.offset| 4) v_prenex_545)) .cse4) 20)))))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (or (< 0 (+ v_DerPreprocessor_706 12)) (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (not (= .cse5 v_DerPreprocessor_705)))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (let ((.cse45 (store .cse0 .cse1 v_DerPreprocessor_704))) (or (forall ((v_prenex_422 Int) (v_prenex_554 Int) (v_prenex_555 Int) (v_DerPreprocessor_609 Int) (v_DerPreprocessor_681 Int) (v_prenex_320 Int) (v_DerPreprocessor_595 Int)) (let ((.cse44 (* v_DerPreprocessor_706 4))) (let ((.cse41 (store .cse45 (+ .cse44 |c_~#queue~0.offset|) v_DerPreprocessor_681)) (.cse42 (+ .cse44 |c_~#queue~0.offset| 4))) (let ((.cse43 (store .cse41 .cse42 v_prenex_554))) (or (not (= v_prenex_555 (+ (select (store (store (store .cse41 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)) .cse42 (select (store (store .cse43 .cse3 v_prenex_555) .cse4 (+ 2 v_DerPreprocessor_706)) .cse42)) .cse3) 1))) (not (= (select (store (store (store (store (store (store .cse43 (+ .cse44 |c_~#queue~0.offset| 8) v_DerPreprocessor_609) (+ .cse44 |c_~#queue~0.offset| 12) v_DerPreprocessor_595) (+ .cse44 16 |c_~#queue~0.offset|) v_prenex_422) .cse3 (+ 3 v_prenex_555)) .cse4 (+ 5 v_DerPreprocessor_706)) (+ .cse44 |c_~#queue~0.offset| 20) v_prenex_320) .cse4) 20))))))) (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse45 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (not (= .cse5 v_DerPreprocessor_705))))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 13) .cse1)) .cse4) 12)) (not (= .cse5 v_DerPreprocessor_705)))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int)) (let ((.cse46 (store .cse0 .cse1 v_DerPreprocessor_704))) (or (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse46 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (forall ((v_DerPreprocessor_636 Int) (v_DerPreprocessor_637 Int) (v_DerPreprocessor_606 Int) (v_DerPreprocessor_518 Int) (v_prenex_425 Int) (v_prenex_235 Int) (v_prenex_313 Int) (v_DerPreprocessor_561 Int) (v_prenex_274 Int) (v_DerPreprocessor_496 Int) (v_prenex_183 Int) (v_DerPreprocessor_697 Int)) (let ((.cse50 (* v_DerPreprocessor_706 4))) (let ((.cse47 (store .cse46 (+ .cse50 |c_~#queue~0.offset|) v_DerPreprocessor_697)) (.cse48 (+ .cse50 |c_~#queue~0.offset| 4))) (let ((.cse49 (store .cse47 .cse48 v_DerPreprocessor_636))) (or (not (= v_DerPreprocessor_637 (+ (select (store (store (store .cse47 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)) .cse48 (select (store (store .cse49 .cse3 v_DerPreprocessor_637) .cse4 (+ 2 v_DerPreprocessor_706)) .cse48)) .cse3) 1))) (not (= (select (store (store (store (store (store (store (store (store (store (store (store .cse49 (+ .cse50 |c_~#queue~0.offset| 8) v_DerPreprocessor_606) (+ .cse50 |c_~#queue~0.offset| 12) v_DerPreprocessor_561) (+ .cse50 16 |c_~#queue~0.offset|) v_prenex_425) (+ .cse50 |c_~#queue~0.offset| 20) v_prenex_313) (+ .cse50 |c_~#queue~0.offset| 24) v_prenex_274) (+ .cse50 |c_~#queue~0.offset| 28) v_DerPreprocessor_518) (+ .cse50 32 |c_~#queue~0.offset|) v_DerPreprocessor_496) (+ .cse50 |c_~#queue~0.offset| 36) v_prenex_235) .cse3 (+ v_DerPreprocessor_637 8)) .cse4 (+ v_DerPreprocessor_706 10)) (+ .cse50 40 |c_~#queue~0.offset|) v_prenex_183) .cse4) 20))))))) (not (= .cse5 v_DerPreprocessor_705)) (= v_DerPreprocessor_706 11)))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 18) .cse1)) .cse4) 17)) (not (= .cse5 v_DerPreprocessor_705)))) (forall ((v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int)) (or (not (= 19 (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_704) .cse3 v_DerPreprocessor_705) .cse4 20) .cse1)) .cse4))) (not (= .cse5 v_DerPreprocessor_705)))) (not (= 21 .cse12)) (or (< 0 (+ .cse23 1)) (forall ((v_DerPreprocessor_547 Int) (v_DerPreprocessor_626 Int) (v_DerPreprocessor_704 Int) (v_DerPreprocessor_705 Int) (v_DerPreprocessor_706 Int) (v_prenex_547 Int) (v_prenex_239 Int) (v_prenex_548 Int) (v_prenex_424 Int) (v_prenex_546 Int) (v_prenex_238 Int) (v_prenex_423 Int) (v_DerPreprocessor_580 Int) (v_DerPreprocessor_660 Int) (v_prenex_273 Int) (v_DerPreprocessor_499 Int) (v_DerPreprocessor_522 Int) (v_ArrVal_1108 Int)) (let ((.cse54 (store .cse0 .cse1 v_DerPreprocessor_704)) (.cse53 (* v_DerPreprocessor_706 4))) (let ((.cse60 (store .cse54 (+ .cse53 |c_~#queue~0.offset|) v_DerPreprocessor_660)) (.cse58 (+ .cse53 |c_~#queue~0.offset| 4))) (let ((.cse59 (store .cse60 .cse58 v_prenex_546))) (let ((.cse55 (store (store (store .cse59 (+ .cse53 |c_~#queue~0.offset| 8) v_DerPreprocessor_626) (+ .cse53 |c_~#queue~0.offset| 12) v_DerPreprocessor_580) (+ .cse53 16 |c_~#queue~0.offset|) v_prenex_423)) (.cse56 (+ .cse53 |c_~#queue~0.offset| 20))) (let ((.cse51 (store .cse55 .cse56 v_DerPreprocessor_547)) (.cse52 (+ .cse53 |c_~#queue~0.offset| 24)) (.cse57 (store (store .cse60 .cse3 (+ v_DerPreprocessor_705 1)) .cse4 (+ v_DerPreprocessor_706 1)))) (or (= (select (store (store (store (store (store (store (store .cse51 .cse52 v_prenex_273) (+ .cse53 |c_~#queue~0.offset| 28) v_DerPreprocessor_522) (+ .cse53 32 |c_~#queue~0.offset|) v_DerPreprocessor_499) (+ .cse53 |c_~#queue~0.offset| 36) v_prenex_239) .cse3 (+ v_prenex_547 8)) .cse4 (+ v_DerPreprocessor_706 10)) (+ .cse53 40 |c_~#queue~0.offset|) v_prenex_238) .cse4) 20) (not (= v_DerPreprocessor_706 (+ (select (store .cse0 .cse1 (select (store (store .cse54 .cse3 v_DerPreprocessor_705) .cse4 v_DerPreprocessor_706) .cse1)) .cse4) 1))) (= (select (store (store (store .cse55 .cse3 (+ 3 v_prenex_547)) .cse4 (+ 5 v_DerPreprocessor_706)) .cse56 v_prenex_424) .cse4) 20) (= (select (store (store (store .cse51 .cse3 (+ v_prenex_547 4)) .cse4 (+ v_DerPreprocessor_706 6)) .cse52 v_ArrVal_1108) .cse4) 20) (not (= .cse5 v_DerPreprocessor_705)) (= v_DerPreprocessor_706 11) (= 20 (select (store .cse57 .cse58 v_prenex_548) .cse4)) (not (= v_prenex_547 (+ (select (store .cse57 .cse58 (select (store (store .cse59 .cse3 v_prenex_547) .cse4 (+ 2 v_DerPreprocessor_706)) .cse58)) .cse3) 1)))))))))))))) (forall ((v_ArrVal_1081 Int)) (= (select (store .cse0 .cse1 v_ArrVal_1081) .cse4) 20))) (forall ((v_ArrVal_1081 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_1081) .cse4) 20))))))) is different from false [2024-06-14 11:24:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2024-06-14 11:24:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105417387] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:24:35,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 11:24:35,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 41 [2024-06-14 11:24:35,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159630601] [2024-06-14 11:24:35,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 11:24:35,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-06-14 11:24:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:24:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-06-14 11:24:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1160, Unknown=21, NotChecked=234, Total=1806 [2024-06-14 11:24:35,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 11:24:35,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 91 transitions, 732 flow. Second operand has 43 states, 43 states have (on average 7.465116279069767) internal successors, (321), 43 states have internal predecessors, (321), 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) [2024-06-14 11:24:35,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:24:35,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 11:24:35,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:24:52,837 INFO L124 PetriNetUnfolderBase]: 5027/8387 cut-off events. [2024-06-14 11:24:52,837 INFO L125 PetriNetUnfolderBase]: For 43555/43595 co-relation queries the response was YES. [2024-06-14 11:24:52,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33613 conditions, 8387 events. 5027/8387 cut-off events. For 43555/43595 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 53526 event pairs, 179 based on Foata normal form. 304/8678 useless extension candidates. Maximal degree in co-relation 28738. Up to 5290 conditions per place. [2024-06-14 11:24:52,875 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 328 selfloop transitions, 91 changer transitions 71/494 dead transitions. [2024-06-14 11:24:52,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 494 transitions, 4292 flow [2024-06-14 11:24:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-06-14 11:24:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-06-14 11:24:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 563 transitions. [2024-06-14 11:24:52,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6014957264957265 [2024-06-14 11:24:52,877 INFO L175 Difference]: Start difference. First operand has 65 places, 91 transitions, 732 flow. Second operand 26 states and 563 transitions. [2024-06-14 11:24:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 494 transitions, 4292 flow [2024-06-14 11:24:52,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 494 transitions, 3880 flow, removed 202 selfloop flow, removed 3 redundant places. [2024-06-14 11:24:52,911 INFO L231 Difference]: Finished difference. Result has 102 places, 149 transitions, 1359 flow [2024-06-14 11:24:52,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1359, PETRI_PLACES=102, PETRI_TRANSITIONS=149} [2024-06-14 11:24:52,911 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2024-06-14 11:24:52,911 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 149 transitions, 1359 flow [2024-06-14 11:24:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.465116279069767) internal successors, (321), 43 states have internal predecessors, (321), 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) [2024-06-14 11:24:52,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:24:52,912 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:24:52,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-14 11:24:53,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:24:53,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:24:53,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:24:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash 836325619, now seen corresponding path program 1 times [2024-06-14 11:24:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:24:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830426553] [2024-06-14 11:24:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:24:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:24:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:24:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-06-14 11:24:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:24:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830426553] [2024-06-14 11:24:53,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830426553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:24:53,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:24:53,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:24:53,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475981368] [2024-06-14 11:24:53,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:24:53,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:24:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:24:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:24:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:24:53,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 11:24:53,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 149 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-06-14 11:24:53,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:24:53,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 11:24:53,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:24:53,821 INFO L124 PetriNetUnfolderBase]: 2312/4529 cut-off events. [2024-06-14 11:24:53,822 INFO L125 PetriNetUnfolderBase]: For 11286/11294 co-relation queries the response was YES. [2024-06-14 11:24:53,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17301 conditions, 4529 events. 2312/4529 cut-off events. For 11286/11294 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 28812 event pairs, 792 based on Foata normal form. 130/4657 useless extension candidates. Maximal degree in co-relation 16177. Up to 2716 conditions per place. [2024-06-14 11:24:53,844 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 78 selfloop transitions, 4 changer transitions 24/110 dead transitions. [2024-06-14 11:24:53,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 110 transitions, 1208 flow [2024-06-14 11:24:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:24:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:24:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-06-14 11:24:53,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-14 11:24:53,847 INFO L175 Difference]: Start difference. First operand has 102 places, 149 transitions, 1359 flow. Second operand 3 states and 56 transitions. [2024-06-14 11:24:53,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 110 transitions, 1208 flow [2024-06-14 11:24:53,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 110 transitions, 1130 flow, removed 24 selfloop flow, removed 11 redundant places. [2024-06-14 11:24:53,869 INFO L231 Difference]: Finished difference. Result has 93 places, 75 transitions, 597 flow [2024-06-14 11:24:53,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=93, PETRI_TRANSITIONS=75} [2024-06-14 11:24:53,871 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2024-06-14 11:24:53,871 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 75 transitions, 597 flow [2024-06-14 11:24:53,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-06-14 11:24:53,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:24:53,872 INFO L208 CegarLoopForPetriNet]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:24:53,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 11:24:53,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:24:53,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:24:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1116509845, now seen corresponding path program 5 times [2024-06-14 11:24:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:24:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507463224] [2024-06-14 11:24:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:24:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:24:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:24:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 190 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:24:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:24:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507463224] [2024-06-14 11:24:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507463224] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 11:24:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423727501] [2024-06-14 11:24:54,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-14 11:24:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:24:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:24:54,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:24:54,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Killed by 15