./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 --validate ./goblint.2024-06-19_11-23-25.files/protection/queue_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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-06-19_11-23-25.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:47:08,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:47:08,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:47:08,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:47:08,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:47:08,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:47:08,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:47:08,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:47:08,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:47:08,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:47:08,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:47:08,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:47:08,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:47:08,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:47:08,206 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:47:08,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:47:08,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:47:08,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:47:08,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:47:08,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:47:08,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:47:08,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:47:08,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:47:08,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:47:08,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:47:08,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:47:08,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:47:08,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:47:08,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:47:08,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:47:08,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:47:08,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:47:08,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:47:08,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:47:08,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:47:08,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:47:08,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:47:08,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:47:08,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:47:08,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:47:08,213 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:47:08,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:47:08,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:47:08,214 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 [2024-06-27 17:47:08,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:47:08,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:47:08,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:47:08,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:47:08,409 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:47:08,410 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-27 17:47:09,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:47:09,752 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:47:09,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2024-06-27 17:47:09,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07e13082/eee40dec2f914295a592400e7851907a/FLAGc91784408 [2024-06-27 17:47:09,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07e13082/eee40dec2f914295a592400e7851907a [2024-06-27 17:47:09,801 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 17:47:09,801 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 17:47:09,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/queue_ok.yml/witness.yml [2024-06-27 17:47:09,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:47:09,882 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 17:47:09,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:47:09,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:47:09,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:47:09,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:47:09" (1/2) ... [2024-06-27 17:47:09,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439879d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:47:09, skipping insertion in model container [2024-06-27 17:47:09,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:47:09" (1/2) ... [2024-06-27 17:47:09,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@158d37c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:47:09, skipping insertion in model container [2024-06-27 17:47:09,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:47:09" (2/2) ... [2024-06-27 17:47:09,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439879d6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:09, skipping insertion in model container [2024-06-27 17:47:09,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:47:09" (2/2) ... [2024-06-27 17:47:09,892 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 17:47:09,923 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 17:47:09,925 INFO L97 edCorrectnessWitness]: Location invariant before [L1054-L1054] ! multithreaded || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20) [2024-06-27 17:47:09,925 INFO L97 edCorrectnessWitness]: Location invariant before [L1053-L1053] ! multithreaded || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20) [2024-06-27 17:47:09,925 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 17:47:09,925 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-27 17:47:09,925 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-27 17:47:09,926 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 0; [2024-06-27 17:47:09,926 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 0; [2024-06-27 17:47:09,926 INFO L106 edCorrectnessWitness]: ghost_update [L1052-L1052] multithreaded = 1; [2024-06-27 17:47:09,926 INFO L106 edCorrectnessWitness]: ghost_update [L1026-L1026] m_locked = 1; [2024-06-27 17:47:09,964 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:47:10,408 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2024-06-27 17:47:10,413 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2024-06-27 17:47:10,416 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:47:10,425 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 17:47:10,525 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] Start Parsing Local [2024-06-27 17:47:10,530 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 17:47:10,565 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:47:10,628 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:47:10,628 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10 WrapperNode [2024-06-27 17:47:10,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:47:10,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:47:10,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:47:10,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:47:10,635 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 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,662 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 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,710 INFO L138 Inliner]: procedures = 274, calls = 233, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 936 [2024-06-27 17:47:10,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:47:10,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:47:10,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:47:10,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:47:10,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,745 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-27 17:47:10,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:47:10,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:47:10,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:47:10,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:47:10,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (1/1) ... [2024-06-27 17:47:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:47:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:47:10,852 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-27 17:47:10,856 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-27 17:47:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 17:47:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 17:47:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 17:47:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 17:47:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:47:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:47:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 17:47:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:47:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:47:10,882 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:47:11,031 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:47:11,033 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:47:11,854 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:47:11,854 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:47:13,397 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:47:13,398 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 17:47:13,399 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:47:13 BoogieIcfgContainer [2024-06-27 17:47:13,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:47:13,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:47:13,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:47:13,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:47:13,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:47:09" (1/4) ... [2024-06-27 17:47:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c025a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:47:13, skipping insertion in model container [2024-06-27 17:47:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:47:09" (2/4) ... [2024-06-27 17:47:13,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c025a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 05:47:13, skipping insertion in model container [2024-06-27 17:47:13,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:47:10" (3/4) ... [2024-06-27 17:47:13,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c025a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 05:47:13, skipping insertion in model container [2024-06-27 17:47:13,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:47:13" (4/4) ... [2024-06-27 17:47:13,407 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-06-27 17:47:13,422 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:47:13,422 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 17:47:13,422 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:47:13,482 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:47:13,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2024-06-27 17:47:13,544 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2024-06-27 17:47:13,544 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:47:13,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 7/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 35. Up to 3 conditions per place. [2024-06-27 17:47:13,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2024-06-27 17:47:13,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2024-06-27 17:47:13,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:47:13,561 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;@6dfc234b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:47:13,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:47:13,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:47:13,564 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 17:47:13,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:47:13,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:47:13,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 17:47:13,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:47:13,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:47:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1993645, now seen corresponding path program 1 times [2024-06-27 17:47:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:47:13,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903043985] [2024-06-27 17:47:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:47:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:47:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:47:13,703 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-27 17:47:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:47:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903043985] [2024-06-27 17:47:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903043985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:47:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:47:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:47:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116448635] [2024-06-27 17:47:13,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:47:13,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 17:47:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:47:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 17:47:13,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 17:47:13,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:47:13,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 95 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-27 17:47:13,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:47:13,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:47:13,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:47:14,071 INFO L124 PetriNetUnfolderBase]: 652/1077 cut-off events. [2024-06-27 17:47:14,072 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-27 17:47:14,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1077 events. 652/1077 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4776 event pairs, 472 based on Foata normal form. 30/883 useless extension candidates. Maximal degree in co-relation 1978. Up to 993 conditions per place. [2024-06-27 17:47:14,079 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 33 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2024-06-27 17:47:14,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 153 flow [2024-06-27 17:47:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 17:47:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 17:47:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2024-06-27 17:47:14,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2024-06-27 17:47:14,090 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 53 transitions. [2024-06-27 17:47:14,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 153 flow [2024-06-27 17:47:14,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:47:14,094 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 82 flow [2024-06-27 17:47:14,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2024-06-27 17:47:14,099 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-06-27 17:47:14,100 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 82 flow [2024-06-27 17:47:14,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-27 17:47:14,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:47:14,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:47:14,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:47:14,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:47:14,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:47:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1286912143, now seen corresponding path program 1 times [2024-06-27 17:47:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:47:14,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878437771] [2024-06-27 17:47:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:47:14,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:47:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:47:14,548 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-27 17:47:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:47:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878437771] [2024-06-27 17:47:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878437771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:47:14,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:47:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:47:14,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884276524] [2024-06-27 17:47:14,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:47:14,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:47:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:47:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:47:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:47:14,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:47:14,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-27 17:47:14,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:47:14,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:47:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:47:14,897 INFO L124 PetriNetUnfolderBase]: 998/1602 cut-off events. [2024-06-27 17:47:14,897 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-27 17:47:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1602 events. 998/1602 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7557 event pairs, 345 based on Foata normal form. 0/1303 useless extension candidates. Maximal degree in co-relation 3154. Up to 964 conditions per place. [2024-06-27 17:47:14,904 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 55 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-06-27 17:47:14,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 251 flow [2024-06-27 17:47:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:47:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:47:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-06-27 17:47:14,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-06-27 17:47:14,906 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 82 flow. Second operand 3 states and 87 transitions. [2024-06-27 17:47:14,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 251 flow [2024-06-27 17:47:14,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 251 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:47:14,909 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 103 flow [2024-06-27 17:47:14,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2024-06-27 17:47:14,910 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2024-06-27 17:47:14,910 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 103 flow [2024-06-27 17:47:14,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-27 17:47:14,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:47:14,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:47:14,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:47:14,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:47:14,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:47:14,911 INFO L85 PathProgramCache]: Analyzing trace with hash 590003107, now seen corresponding path program 1 times [2024-06-27 17:47:14,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:47:14,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769651836] [2024-06-27 17:47:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:47:14,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:47:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:47:15,395 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-27 17:47:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:47:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769651836] [2024-06-27 17:47:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769651836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:47:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:47:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:47:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713994285] [2024-06-27 17:47:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:47:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:47:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:47:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:47:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:47:15,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:47:15,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-27 17:47:15,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:47:15,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:47:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:47:15,793 INFO L124 PetriNetUnfolderBase]: 1240/1979 cut-off events. [2024-06-27 17:47:15,794 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-06-27 17:47:15,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4227 conditions, 1979 events. 1240/1979 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9733 event pairs, 357 based on Foata normal form. 40/1909 useless extension candidates. Maximal degree in co-relation 4222. Up to 981 conditions per place. [2024-06-27 17:47:15,800 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 75 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-06-27 17:47:15,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 86 transitions, 363 flow [2024-06-27 17:47:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:47:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:47:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-06-27 17:47:15,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6276595744680851 [2024-06-27 17:47:15,802 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 103 flow. Second operand 4 states and 118 transitions. [2024-06-27 17:47:15,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 86 transitions, 363 flow [2024-06-27 17:47:15,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 86 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:47:15,804 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 129 flow [2024-06-27 17:47:15,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-06-27 17:47:15,805 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-27 17:47:15,805 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 129 flow [2024-06-27 17:47:15,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-27 17:47:15,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:47:15,805 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:47:15,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:47:15,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:47:15,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:47:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1110229998, now seen corresponding path program 2 times [2024-06-27 17:47:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:47:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684496933] [2024-06-27 17:47:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:47:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:47:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:47:16,387 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-27 17:47:16,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:47:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684496933] [2024-06-27 17:47:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684496933] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:47:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094549781] [2024-06-27 17:47:16,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:47:16,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:47:16,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:47:16,389 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-27 17:47:16,428 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-27 17:47:16,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:47:16,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:47:16,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 17 conjunts are in the unsatisfiable core [2024-06-27 17:47:16,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:47:16,700 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-27 17:47:16,761 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 117 treesize of output 107 [2024-06-27 17:47:16,764 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-27 17:47:16,789 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 124 treesize of output 112 [2024-06-27 17:47:16,823 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-27 17:47:16,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:47:16,992 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-27 17:47:21,008 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 (or (forall ((v_ArrVal_407 Int)) (= (select (store .cse0 .cse1 v_ArrVal_407) .cse2) 20)) (let ((.cse6 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (and (not (= 22 .cse3)) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ v_DerPreprocessor_7 1)) (not (= v_DerPreprocessor_7 (+ (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_5) .cse4 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse1)) .cse2) 1))) (not (= (+ (select .cse0 .cse4) 1) v_DerPreprocessor_6)))) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (let ((.cse5 (store .cse0 .cse1 v_DerPreprocessor_5))) (let ((.cse7 (store .cse0 .cse1 (select (store (store .cse5 .cse4 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse1)))) (or (< (select .cse5 .cse6) 21) (not (= (+ (select .cse7 .cse4) 1) v_DerPreprocessor_6)) (not (= v_DerPreprocessor_7 (+ (select .cse7 .cse2) 1))))))) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (let ((.cse8 (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_5) .cse4 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse1)))) (or (not (= (+ (select .cse8 .cse4) 1) v_DerPreprocessor_6)) (< v_DerPreprocessor_7 21) (not (= v_DerPreprocessor_7 (+ (select .cse8 .cse2) 1)))))) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (let ((.cse10 (store .cse0 .cse1 v_DerPreprocessor_5))) (let ((.cse9 (store .cse0 .cse1 (select (store (store .cse10 .cse4 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse1)))) (or (not (= (+ (select .cse9 .cse4) 1) v_DerPreprocessor_6)) (not (= v_DerPreprocessor_7 (+ (select .cse9 .cse2) 1))) (< 0 (+ (select .cse10 .cse6) 1)))))) (not (= 21 .cse3))))) (forall ((v_ArrVal_407 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_407) .cse2) 20))))))) is different from false [2024-06-27 17:47:21,135 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-27 17:47:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-06-27 17:47:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094549781] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:47:42,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:47:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-06-27 17:47:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322800570] [2024-06-27 17:47:42,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:47:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:47:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:47:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:47:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=54, Unknown=6, NotChecked=16, Total=110 [2024-06-27 17:47:42,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:47:42,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 129 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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-27 17:47:42,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:47:42,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:47:42,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:47:54,964 INFO L124 PetriNetUnfolderBase]: 2089/3329 cut-off events. [2024-06-27 17:47:54,965 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2024-06-27 17:47:54,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7501 conditions, 3329 events. 2089/3329 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17842 event pairs, 340 based on Foata normal form. 171/3320 useless extension candidates. Maximal degree in co-relation 7495. Up to 726 conditions per place. [2024-06-27 17:47:54,975 INFO L140 encePairwiseOnDemand]: 24/47 looper letters, 141 selfloop transitions, 29 changer transitions 0/176 dead transitions. [2024-06-27 17:47:54,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 176 transitions, 784 flow [2024-06-27 17:47:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:47:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:47:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2024-06-27 17:47:54,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648936170212766 [2024-06-27 17:47:54,979 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 129 flow. Second operand 8 states and 250 transitions. [2024-06-27 17:47:54,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 176 transitions, 784 flow [2024-06-27 17:47:54,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 176 transitions, 773 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:47:54,984 INFO L231 Difference]: Finished difference. Result has 54 places, 67 transitions, 358 flow [2024-06-27 17:47:54,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=54, PETRI_TRANSITIONS=67} [2024-06-27 17:47:54,986 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-06-27 17:47:54,986 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 67 transitions, 358 flow [2024-06-27 17:47:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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-27 17:47:54,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:47:54,986 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:47:55,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:47:55,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:47:55,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:47:55,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:47:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1491590845, now seen corresponding path program 3 times [2024-06-27 17:47:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:47:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017577195] [2024-06-27 17:47:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:47:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:47:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:47:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:47:56,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:47:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017577195] [2024-06-27 17:47:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017577195] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:47:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715385420] [2024-06-27 17:47:56,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:47:56,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:47:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:47:56,602 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-27 17:47:56,603 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-27 17:47:57,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 17:47:57,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:47:57,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 33 conjunts are in the unsatisfiable core [2024-06-27 17:47:57,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:47:57,051 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-27 17:47:57,094 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 117 treesize of output 107 [2024-06-27 17:47:57,096 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-27 17:47:57,118 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 124 treesize of output 112 [2024-06-27 17:47:57,126 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-27 17:47:57,131 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-27 17:47:57,154 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 131 treesize of output 117 [2024-06-27 17:47:57,191 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 138 treesize of output 122 [2024-06-27 17:47:57,232 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 145 treesize of output 127 [2024-06-27 17:47:57,243 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-27 17:47:57,248 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-27 17:47:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:47:57,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:47:57,369 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-27 17:47:57,372 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-27 17:47:57,405 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-27 17:47:57,422 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-27 17:47:57,552 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-27 17:47:57,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:47:57,602 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 37 treesize of output 21 [2024-06-27 17:47:57,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 35 treesize of output 19 [2024-06-27 17:47:57,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:47:57,639 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 35 treesize of output 19 [2024-06-27 17:47:57,671 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-27 17:47:57,709 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 37 treesize of output 21 [2024-06-27 17:47:58,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:47:58,116 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 80 treesize of output 44 [2024-06-27 17:47:58,279 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-27 17:47:58,987 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 91 treesize of output 51 [2024-06-27 17:47:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:47:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715385420] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:47:59,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:47:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-06-27 17:47:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977614373] [2024-06-27 17:47:59,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:47:59,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 17:47:59,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:47:59,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 17:47:59,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2024-06-27 17:47:59,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:47:59,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 67 transitions, 358 flow. Second operand has 20 states, 20 states have (on average 11.1) internal successors, (222), 20 states have internal predecessors, (222), 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-27 17:47:59,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:47:59,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:47:59,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:02,340 INFO L124 PetriNetUnfolderBase]: 5016/7984 cut-off events. [2024-06-27 17:48:02,340 INFO L125 PetriNetUnfolderBase]: For 11057/11099 co-relation queries the response was YES. [2024-06-27 17:48:02,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24852 conditions, 7984 events. 5016/7984 cut-off events. For 11057/11099 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 48114 event pairs, 337 based on Foata normal form. 328/7839 useless extension candidates. Maximal degree in co-relation 24842. Up to 5550 conditions per place. [2024-06-27 17:48:02,376 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 321 selfloop transitions, 27 changer transitions 0/354 dead transitions. [2024-06-27 17:48:02,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 354 transitions, 2274 flow [2024-06-27 17:48:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:48:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:48:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 452 transitions. [2024-06-27 17:48:02,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6869300911854104 [2024-06-27 17:48:02,379 INFO L175 Difference]: Start difference. First operand has 54 places, 67 transitions, 358 flow. Second operand 14 states and 452 transitions. [2024-06-27 17:48:02,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 354 transitions, 2274 flow [2024-06-27 17:48:02,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 354 transitions, 2240 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:02,392 INFO L231 Difference]: Finished difference. Result has 74 places, 84 transitions, 611 flow [2024-06-27 17:48:02,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=611, PETRI_PLACES=74, PETRI_TRANSITIONS=84} [2024-06-27 17:48:02,394 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-27 17:48:02,395 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 84 transitions, 611 flow [2024-06-27 17:48:02,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.1) internal successors, (222), 20 states have internal predecessors, (222), 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-27 17:48:02,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:02,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:02,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:48:02,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:48:02,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:48:02,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1780613686, now seen corresponding path program 1 times [2024-06-27 17:48:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593497623] [2024-06-27 17:48:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:02,673 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-27 17:48:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593497623] [2024-06-27 17:48:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593497623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:02,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:48:02,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405541017] [2024-06-27 17:48:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:02,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:48:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:48:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:48:02,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:48:02,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 84 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-27 17:48:02,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:02,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:48:02,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:03,348 INFO L124 PetriNetUnfolderBase]: 3744/6491 cut-off events. [2024-06-27 17:48:03,348 INFO L125 PetriNetUnfolderBase]: For 8618/8746 co-relation queries the response was YES. [2024-06-27 17:48:03,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20193 conditions, 6491 events. 3744/6491 cut-off events. For 8618/8746 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 41633 event pairs, 1493 based on Foata normal form. 53/6232 useless extension candidates. Maximal degree in co-relation 20173. Up to 4345 conditions per place. [2024-06-27 17:48:03,379 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 74 selfloop transitions, 4 changer transitions 2/86 dead transitions. [2024-06-27 17:48:03,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 86 transitions, 757 flow [2024-06-27 17:48:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:48:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:48:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-27 17:48:03,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-06-27 17:48:03,381 INFO L175 Difference]: Start difference. First operand has 74 places, 84 transitions, 611 flow. Second operand 3 states and 77 transitions. [2024-06-27 17:48:03,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 86 transitions, 757 flow [2024-06-27 17:48:03,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 697 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-27 17:48:03,393 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 444 flow [2024-06-27 17:48:03,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-06-27 17:48:03,395 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2024-06-27 17:48:03,395 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 444 flow [2024-06-27 17:48:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-27 17:48:03,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:03,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:03,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:48:03,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:48:03,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash 397500033, now seen corresponding path program 1 times [2024-06-27 17:48:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350993011] [2024-06-27 17:48:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:03,427 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-27 17:48:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350993011] [2024-06-27 17:48:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350993011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:03,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:03,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693044467] [2024-06-27 17:48:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:03,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:48:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:48:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:48:03,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:48:03,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-27 17:48:03,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:03,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:48:03,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:04,003 INFO L124 PetriNetUnfolderBase]: 3566/6191 cut-off events. [2024-06-27 17:48:04,003 INFO L125 PetriNetUnfolderBase]: For 7523/7596 co-relation queries the response was YES. [2024-06-27 17:48:04,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19740 conditions, 6191 events. 3566/6191 cut-off events. For 7523/7596 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 39433 event pairs, 3025 based on Foata normal form. 19/6081 useless extension candidates. Maximal degree in co-relation 19718. Up to 6017 conditions per place. [2024-06-27 17:48:04,027 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 71 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-06-27 17:48:04,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 625 flow [2024-06-27 17:48:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:48:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:48:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-27 17:48:04,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-06-27 17:48:04,029 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 444 flow. Second operand 3 states and 72 transitions. [2024-06-27 17:48:04,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 625 flow [2024-06-27 17:48:04,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:04,046 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 437 flow [2024-06-27 17:48:04,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-06-27 17:48:04,047 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-27 17:48:04,047 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 437 flow [2024-06-27 17:48:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-27 17:48:04,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:04,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:48:04,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:48:04,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -470512844, now seen corresponding path program 1 times [2024-06-27 17:48:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34634806] [2024-06-27 17:48:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:04,102 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-27 17:48:04,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34634806] [2024-06-27 17:48:04,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34634806] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:48:04,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078624982] [2024-06-27 17:48:04,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:04,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:48:04,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:48:04,117 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-27 17:48:04,132 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-27 17:48:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:04,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:48:04,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:48:04,302 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 11 treesize of output 7 [2024-06-27 17:48:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:04,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:48:04,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078624982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:48:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-06-27 17:48:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650382487] [2024-06-27 17:48:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:04,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:48:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:48:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:48:04,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:48:04,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-27 17:48:04,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:04,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:48:04,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:04,820 INFO L124 PetriNetUnfolderBase]: 2629/5041 cut-off events. [2024-06-27 17:48:04,821 INFO L125 PetriNetUnfolderBase]: For 5771/5775 co-relation queries the response was YES. [2024-06-27 17:48:04,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15537 conditions, 5041 events. 2629/5041 cut-off events. For 5771/5775 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 33479 event pairs, 949 based on Foata normal form. 92/5057 useless extension candidates. Maximal degree in co-relation 15514. Up to 3219 conditions per place. [2024-06-27 17:48:04,840 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 71 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2024-06-27 17:48:04,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 674 flow [2024-06-27 17:48:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:48:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:48:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 17:48:04,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-06-27 17:48:04,843 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 437 flow. Second operand 3 states and 76 transitions. [2024-06-27 17:48:04,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 674 flow [2024-06-27 17:48:04,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 668 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:04,852 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 427 flow [2024-06-27 17:48:04,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-06-27 17:48:04,853 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-27 17:48:04,853 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 427 flow [2024-06-27 17:48:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-27 17:48:04,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:04,853 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:48:05,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:48:05,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:48:05,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1488723698, now seen corresponding path program 4 times [2024-06-27 17:48:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092691990] [2024-06-27 17:48:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:11,697 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-27 17:48:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092691990] [2024-06-27 17:48:11,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092691990] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:48:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418543088] [2024-06-27 17:48:11,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:48:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:48:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:48:11,699 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-27 17:48:11,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 17:48:12,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:48:12,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:48:12,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 39 conjunts are in the unsatisfiable core [2024-06-27 17:48:12,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:48:12,057 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 22 treesize of output 21 [2024-06-27 17:48:12,094 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 155 treesize of output 145 [2024-06-27 17:48:12,098 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-27 17:48:12,125 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 162 treesize of output 150 [2024-06-27 17:48:12,172 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 159 [2024-06-27 17:48:12,184 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-27 17:48:12,234 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 168 [2024-06-27 17:48:12,300 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 195 treesize of output 177 [2024-06-27 17:48:12,311 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-27 17:48:12,318 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-27 17:48:12,410 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 206 treesize of output 186 [2024-06-27 17:48:12,418 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-27 17:48:12,423 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-27 17:48:12,574 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 217 treesize of output 195 [2024-06-27 17:48:12,578 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-27 17:48:12,603 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-27 17:48:12,767 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 228 treesize of output 204 [2024-06-27 17:48:12,801 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-27 17:48:13,022 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 239 treesize of output 213 [2024-06-27 17:48:13,375 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 250 treesize of output 222 [2024-06-27 17:48:13,925 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 261 treesize of output 231 [2024-06-27 17:48:14,562 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 272 treesize of output 240 [2024-06-27 17:48:15,348 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-27 17:48:15,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:48:15,508 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-27 17:48:15,672 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-27 17:48:15,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:48:15,896 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 317 treesize of output 177 [2024-06-27 17:48:55,763 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-27 17:48:55,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:48:55,781 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 329 treesize of output 185 [2024-06-27 17:48:56,317 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 37 treesize of output 21 [2024-06-27 17:48:56,325 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 85 treesize of output 49 [2024-06-27 17:48:56,405 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 85 treesize of output 49 [2024-06-27 17:48:56,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:48:56,482 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 116 treesize of output 64 [2024-06-27 17:48:56,507 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-27 17:48:56,515 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-27 17:48:56,602 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 116 treesize of output 64 [2024-06-27 17:48:56,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:48:56,706 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 118 treesize of output 66 [2024-06-27 17:48:56,720 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 27 treesize of output 23 [2024-06-27 17:48:56,749 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-27 17:48:56,798 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-27 17:49:53,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:49:53,626 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 193 treesize of output 137 [2024-06-27 17:49:53,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:49:53,738 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 112 treesize of output 88 [2024-06-27 17:49:53,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:49:53,821 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 16 treesize of output 8 [2024-06-27 17:49:53,843 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-27 17:49:53,860 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 105 treesize of output 85 [2024-06-27 17:49:54,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 30 treesize of output 18 [2024-06-27 17:49:58,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse10 .cse4))) (let ((.cse63 (* .cse0 4)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse64 (select .cse10 .cse6)) (.cse11 (+ .cse63 |c_~#queue~0.offset|))) (let ((.cse23 (select .cse10 (+ |c_~#queue~0.offset| 80))) (.cse26 (forall ((v_ArrVal_1159 Int)) (= (select (store .cse10 .cse11 v_ArrVal_1159) .cse4) 20))) (.cse19 (+ 3 .cse64)) (.cse15 (+ .cse64 4)) (.cse21 (+ 5 .cse64)) (.cse7 (+ 2 .cse64)) (.cse8 (+ .cse64 1)) (.cse9 (+ .cse0 1)) (.cse2 (+ .cse63 |c_~#queue~0.offset| 4))) (and (not (= 22 .cse0)) (forall ((v_ArrVal_1163 Int) (v_DerPreprocessor_394 Int) (v_ArrVal_1167 Int) (v_DerPreprocessor_396 Int) (v_DerPreprocessor_420 Int)) (let ((.cse5 (store .cse10 .cse11 v_DerPreprocessor_420))) (let ((.cse1 (store (store .cse5 .cse6 .cse8) .cse4 .cse9)) (.cse3 (store (store (store .cse5 .cse2 v_DerPreprocessor_394) .cse6 .cse7) .cse4 v_DerPreprocessor_396))) (or (not (= v_DerPreprocessor_396 (+ 1 (select (store .cse1 .cse2 (select .cse3 .cse2)) .cse4)))) (= (select (store .cse1 .cse2 v_ArrVal_1163) .cse4) 20) (not (= (select (store .cse3 (+ (* v_DerPreprocessor_396 4) |c_~#queue~0.offset|) v_ArrVal_1167) .cse4) 20)))))) (or (forall ((v_prenex_314 Int) (v_DerPreprocessor_405 Int) (v_prenex_312 Int) (v_ArrVal_1163 Int) (v_prenex_313 Int) (v_prenex_311 Int) (v_ArrVal_1167 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_354 Int) (v_DerPreprocessor_356 Int) (v_DerPreprocessor_334 Int)) (let ((.cse22 (* v_DerPreprocessor_356 4)) (.cse24 (store .cse10 .cse11 v_DerPreprocessor_405))) (let ((.cse25 (store .cse24 .cse2 v_DerPreprocessor_354)) (.cse17 (+ .cse22 |c_~#queue~0.offset|))) (let ((.cse18 (store .cse25 .cse17 v_DerPreprocessor_334)) (.cse20 (+ .cse22 |c_~#queue~0.offset| 4))) (let ((.cse13 (store (store .cse25 .cse6 .cse7) .cse4 v_DerPreprocessor_356)) (.cse12 (store (store .cse24 .cse6 .cse8) .cse4 .cse9)) (.cse14 (store .cse18 .cse20 v_prenex_313)) (.cse16 (+ .cse22 |c_~#queue~0.offset| 8))) (or (not (= v_DerPreprocessor_356 (+ (select (store .cse12 .cse2 (select .cse13 .cse2)) .cse4) 1))) (= (select (store (store (store .cse14 .cse6 .cse15) .cse4 (+ 2 v_DerPreprocessor_356)) .cse16 v_prenex_312) .cse4) 20) (= 20 (select (store .cse13 .cse17 v_ArrVal_1167) .cse4)) (= (select (store .cse12 .cse2 v_ArrVal_1163) .cse4) 20) (= 20 (select (store (store (store .cse18 .cse6 .cse19) .cse4 (+ v_DerPreprocessor_356 1)) .cse20 v_ArrVal_1169) .cse4)) (= (select (store (store (store (store .cse14 .cse16 v_prenex_311) .cse6 .cse21) .cse4 (+ 3 v_DerPreprocessor_356)) (+ .cse22 |c_~#queue~0.offset| 12) v_prenex_314) .cse4) 20) (< .cse23 21))))))) .cse26) (forall ((v_ArrVal_1159 Int)) (not (= (select (store .cse10 .cse11 v_ArrVal_1159) .cse4) 20))) (or (forall ((v_DerPreprocessor_317 Int) (v_prenex_304 Int) (v_ArrVal_1163 Int) (v_DerPreprocessor_380 Int) (v_ArrVal_1167 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_378 Int) (v_DerPreprocessor_334 Int) (v_DerPreprocessor_400 Int) (v_DerPreprocessor_325 Int) (v_prenex_228 Int)) (let ((.cse34 (* v_DerPreprocessor_380 4)) (.cse36 (store .cse10 .cse11 v_DerPreprocessor_400))) (let ((.cse35 (store .cse36 .cse2 v_DerPreprocessor_378)) (.cse31 (+ .cse34 |c_~#queue~0.offset|))) (let ((.cse32 (store .cse35 .cse31 v_DerPreprocessor_334)) (.cse33 (+ .cse34 |c_~#queue~0.offset| 4))) (let ((.cse27 (store (store .cse36 .cse6 .cse8) .cse4 .cse9)) (.cse30 (store (store .cse35 .cse6 .cse7) .cse4 v_DerPreprocessor_380)) (.cse28 (store .cse32 .cse33 v_DerPreprocessor_325)) (.cse29 (+ .cse34 |c_~#queue~0.offset| 8))) (or (= (select (store .cse27 .cse2 v_ArrVal_1163) .cse4) 20) (= (select (store (store (store .cse28 .cse6 .cse15) .cse4 (+ 2 v_DerPreprocessor_380)) .cse29 v_prenex_304) .cse4) 20) (= (select (store .cse30 .cse31 v_ArrVal_1167) .cse4) 20) (not (= (+ (select (store .cse27 .cse2 (select .cse30 .cse2)) .cse4) 1) v_DerPreprocessor_380)) (< 0 (+ .cse23 1)) (= (select (store (store (store .cse32 .cse6 .cse19) .cse4 (+ v_DerPreprocessor_380 1)) .cse33 v_ArrVal_1169) .cse4) 20) (= (select (store (store (store (store .cse28 .cse29 v_DerPreprocessor_317) .cse6 .cse21) .cse4 (+ 3 v_DerPreprocessor_380)) (+ .cse34 |c_~#queue~0.offset| 12) v_prenex_228) .cse4) 20))))))) .cse26) (forall ((v_DerPreprocessor_416 Int) (v_ArrVal_1171 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_322 Int) (v_DerPreprocessor_345 Int) (v_DerPreprocessor_334 Int) (v_DerPreprocessor_347 Int)) (let ((.cse39 (store .cse10 .cse11 v_DerPreprocessor_416))) (let ((.cse40 (store .cse39 .cse2 v_DerPreprocessor_345)) (.cse41 (* v_DerPreprocessor_347 4))) (let ((.cse37 (store .cse40 (+ .cse41 |c_~#queue~0.offset|) v_DerPreprocessor_334)) (.cse38 (+ .cse41 |c_~#queue~0.offset| 4))) (or (= (select (store (store (store .cse37 .cse6 .cse19) .cse4 (+ v_DerPreprocessor_347 1)) .cse38 v_ArrVal_1169) .cse4) 20) (not (= (+ (select (store (store (store .cse39 .cse6 .cse8) .cse4 .cse9) .cse2 (select (store (store .cse40 .cse6 .cse7) .cse4 v_DerPreprocessor_347) .cse2)) .cse4) 1) v_DerPreprocessor_347)) (not (= (select (store (store (store (store .cse37 .cse38 v_DerPreprocessor_322) .cse6 .cse15) .cse4 (+ 2 v_DerPreprocessor_347)) (+ .cse41 |c_~#queue~0.offset| 8) v_ArrVal_1171) .cse4) 20))))))) (not (= .cse0 20)) (forall ((v_DerPreprocessor_391 Int) (v_ArrVal_1167 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_331 Int) (v_DerPreprocessor_421 Int) (v_DerPreprocessor_389 Int)) (let ((.cse45 (store .cse10 .cse11 v_DerPreprocessor_421))) (let ((.cse44 (* v_DerPreprocessor_391 4)) (.cse42 (store .cse45 .cse2 v_DerPreprocessor_389))) (let ((.cse46 (store (store .cse42 .cse6 .cse7) .cse4 v_DerPreprocessor_391)) (.cse43 (+ |c_~#queue~0.offset| .cse44))) (or (not (= (select (store (store (store (store .cse42 .cse43 v_DerPreprocessor_331) .cse6 .cse19) .cse4 (+ v_DerPreprocessor_391 1)) (+ |c_~#queue~0.offset| 4 .cse44) v_ArrVal_1169) .cse4) 20)) (not (= v_DerPreprocessor_391 (+ (select (store (store (store .cse45 .cse6 .cse8) .cse4 .cse9) .cse2 (select .cse46 .cse2)) .cse4) 1))) (= (select (store .cse46 .cse43 v_ArrVal_1167) .cse4) 20)))))) (forall ((v_DerPreprocessor_338 Int) (v_DerPreprocessor_418 Int) (v_DerPreprocessor_336 Int)) (or (not (= v_DerPreprocessor_338 (+ (select (let ((.cse47 (store .cse10 .cse11 v_DerPreprocessor_418))) (store (store (store .cse47 .cse6 .cse8) .cse4 .cse9) .cse2 (select (store (store (store .cse47 .cse2 v_DerPreprocessor_336) .cse6 .cse7) .cse4 v_DerPreprocessor_338) .cse2))) .cse4) 1))) (< 0 (+ 5 v_DerPreprocessor_338)))) (forall ((v_ArrVal_1163 Int) (v_DerPreprocessor_423 Int)) (not (= (select (store (store (store (store .cse10 .cse11 v_DerPreprocessor_423) .cse6 .cse8) .cse4 .cse9) .cse2 v_ArrVal_1163) .cse4) 20))) (not (= 21 .cse0)) (forall ((v_DerPreprocessor_349 Int) (v_ArrVal_1174 Int) (v_DerPreprocessor_419 Int) (v_prenex_310 Int) (v_DerPreprocessor_351 Int) (v_prenex_241 Int) (v_prenex_309 Int) (v_DerPreprocessor_334 Int)) (let ((.cse48 (store .cse10 .cse11 v_DerPreprocessor_419))) (let ((.cse49 (store .cse48 .cse2 v_DerPreprocessor_349)) (.cse52 (* v_DerPreprocessor_351 4))) (let ((.cse50 (store (store .cse49 (+ |c_~#queue~0.offset| .cse52) v_DerPreprocessor_334) (+ |c_~#queue~0.offset| .cse52 4) v_prenex_310)) (.cse51 (+ |c_~#queue~0.offset| 8 .cse52))) (or (not (= v_DerPreprocessor_351 (+ (select (store (store (store .cse48 .cse6 .cse8) .cse4 .cse9) .cse2 (select (store (store .cse49 .cse6 .cse7) .cse4 v_DerPreprocessor_351) .cse2)) .cse4) 1))) (not (= (select (store (store (store (store .cse50 .cse51 v_prenex_241) .cse6 .cse21) .cse4 (+ 3 v_DerPreprocessor_351)) (+ |c_~#queue~0.offset| 12 .cse52) v_ArrVal_1174) .cse4) 20)) (= (select (store (store (store .cse50 .cse6 .cse15) .cse4 (+ 2 v_DerPreprocessor_351)) .cse51 v_prenex_309) .cse4) 20)))))) (forall ((v_DerPreprocessor_373 Int)) (or (forall ((v_DerPreprocessor_415 Int) (v_ArrVal_1163 Int) (v_DerPreprocessor_371 Int) (v_ArrVal_1167 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_334 Int) (v_prenex_307 Int) (v_prenex_308 Int) (v_prenex_305 Int) (v_prenex_306 Int)) (let ((.cse60 (* v_DerPreprocessor_373 4)) (.cse62 (store .cse10 .cse11 v_DerPreprocessor_415))) (let ((.cse61 (store .cse62 .cse2 v_DerPreprocessor_371)) (.cse56 (+ .cse60 |c_~#queue~0.offset|))) (let ((.cse53 (store .cse61 .cse56 v_DerPreprocessor_334)) (.cse54 (+ .cse60 |c_~#queue~0.offset| 4))) (let ((.cse57 (store .cse53 .cse54 v_prenex_307)) (.cse58 (+ .cse60 |c_~#queue~0.offset| 8)) (.cse59 (store (store .cse62 .cse6 .cse8) .cse4 .cse9)) (.cse55 (store (store .cse61 .cse6 .cse7) .cse4 v_DerPreprocessor_373))) (or (= (select (store (store (store .cse53 .cse6 .cse19) .cse4 (+ v_DerPreprocessor_373 1)) .cse54 v_ArrVal_1169) .cse4) 20) (= 20 (select (store .cse55 .cse56 v_ArrVal_1167) .cse4)) (= (select (store (store (store .cse57 .cse6 .cse15) .cse4 (+ 2 v_DerPreprocessor_373)) .cse58 v_prenex_306) .cse4) 20) (= 20 (select (store .cse59 .cse2 v_ArrVal_1163) .cse4)) (= (select (store (store (store (store .cse57 .cse58 v_prenex_305) .cse6 .cse21) .cse4 (+ 3 v_DerPreprocessor_373)) (+ .cse60 |c_~#queue~0.offset| 12) v_prenex_308) .cse4) 20) (not (= v_DerPreprocessor_373 (+ (select (store .cse59 .cse2 (select .cse55 .cse2)) .cse4) 1))))))))) (< v_DerPreprocessor_373 17))))))))) is different from false [2024-06-27 17:49:58,881 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-27 17:50:02,902 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 ((.cse19 (select .cse0 .cse2))) (let ((.cse1 (+ (* .cse19 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1158 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_1158) .cse2) 20))) (or (let ((.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse0 (+ |c_~#queue~0.offset| 80))) (.cse11 (+ .cse19 1)) (.cse15 (+ (select .cse0 .cse9) 1))) (and (or (< 0 (+ .cse3 1)) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_317 Int) (v_DerPreprocessor_428 Int) (v_prenex_228 Int) (v_prenex_525 Int) (v_prenex_526 Int) (v_prenex_523 Int) (v_prenex_524 Int) (v_prenex_304 Int) (v_DerPreprocessor_380 Int) (v_DerPreprocessor_400 Int) (v_DerPreprocessor_378 Int) (v_DerPreprocessor_325 Int)) (let ((.cse18 (* v_DerPreprocessor_428 4))) (let ((.cse14 (* v_DerPreprocessor_380 4)) (.cse17 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse18 |c_~#queue~0.offset|) v_DerPreprocessor_400)) (.cse7 (+ .cse18 |c_~#queue~0.offset| 4))) (let ((.cse16 (store .cse17 .cse7 v_DerPreprocessor_378)) (.cse5 (+ .cse14 |c_~#queue~0.offset|))) (let ((.cse8 (store .cse16 .cse5 v_prenex_526)) (.cse10 (+ .cse14 |c_~#queue~0.offset| 4))) (let ((.cse6 (store (store .cse17 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1))) (.cse4 (store (store .cse16 .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_380)) (.cse12 (store .cse8 .cse10 v_DerPreprocessor_325)) (.cse13 (+ .cse14 |c_~#queue~0.offset| 8))) (or (= (select (store .cse4 .cse5 v_prenex_524) .cse2) 20) (= (select (store .cse6 .cse7 v_prenex_523) .cse2) 20) (= (select (store (store (store .cse8 .cse9 (+ 3 v_DerPreprocessor_427)) .cse2 (+ v_DerPreprocessor_380 1)) .cse10 v_prenex_525) .cse2) 20) (not (= v_DerPreprocessor_428 .cse11)) (= (select (store (store (store (store .cse12 .cse13 v_DerPreprocessor_317) .cse9 (+ 5 v_DerPreprocessor_427)) .cse2 (+ 3 v_DerPreprocessor_380)) (+ .cse14 |c_~#queue~0.offset| 12) v_prenex_228) .cse2) 20) (not (= (+ (select (store .cse6 .cse7 (select .cse4 .cse7)) .cse2) 1) v_DerPreprocessor_380)) (not (= .cse15 v_DerPreprocessor_427)) (= (select (store (store (store .cse12 .cse9 (+ v_DerPreprocessor_427 4)) .cse2 (+ 2 v_DerPreprocessor_380)) .cse13 v_prenex_304) .cse2) 20))))))))) (not (= 22 .cse19)) (forall ((v_DerPreprocessor_427 Int)) (or (not (= .cse19 20)) (not (= .cse15 v_DerPreprocessor_427)))) (forall ((v_DerPreprocessor_427 Int)) (or (not (= .cse15 v_DerPreprocessor_427)) (not (= 19 .cse19)))) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (forall ((v_DerPreprocessor_338 Int) (v_DerPreprocessor_418 Int) (v_DerPreprocessor_336 Int)) (or (not (= v_DerPreprocessor_338 (+ (select (let ((.cse22 (* v_DerPreprocessor_428 4))) (let ((.cse20 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse22 |c_~#queue~0.offset|) v_DerPreprocessor_418)) (.cse21 (+ .cse22 |c_~#queue~0.offset| 4))) (store (store (store .cse20 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1)) .cse21 (select (store (store (store .cse20 .cse21 v_DerPreprocessor_336) .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_338) .cse21)))) .cse2) 1))) (< 0 (+ 5 v_DerPreprocessor_338)))) (not (= v_DerPreprocessor_428 .cse11)) (not (= .cse15 v_DerPreprocessor_427)))) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (not (= v_DerPreprocessor_428 .cse11)) (forall ((v_prenex_521 Int) (v_DerPreprocessor_391 Int) (v_prenex_522 Int) (v_DerPreprocessor_331 Int) (v_DerPreprocessor_421 Int) (v_DerPreprocessor_389 Int)) (let ((.cse29 (* v_DerPreprocessor_428 4))) (let ((.cse27 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse29 |c_~#queue~0.offset|) v_DerPreprocessor_421)) (.cse28 (+ .cse29 |c_~#queue~0.offset| 4))) (let ((.cse23 (store .cse27 .cse28 v_DerPreprocessor_389)) (.cse25 (* v_DerPreprocessor_391 4))) (let ((.cse24 (+ |c_~#queue~0.offset| .cse25)) (.cse26 (store (store .cse23 .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_391))) (or (not (= (select (store (store (store (store .cse23 .cse24 v_DerPreprocessor_331) .cse9 (+ 3 v_DerPreprocessor_427)) .cse2 (+ v_DerPreprocessor_391 1)) (+ |c_~#queue~0.offset| 4 .cse25) v_prenex_522) .cse2) 20)) (= (select (store .cse26 .cse24 v_prenex_521) .cse2) 20) (not (= (+ (select (store (store (store .cse27 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1)) .cse28 (select .cse26 .cse28)) .cse2) 1) v_DerPreprocessor_391)))))))) (not (= .cse15 v_DerPreprocessor_427)))) (or (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_405 Int) (v_DerPreprocessor_428 Int) (v_prenex_529 Int) (v_prenex_314 Int) (v_prenex_312 Int) (v_prenex_533 Int) (v_prenex_313 Int) (v_prenex_530 Int) (v_prenex_311 Int) (v_prenex_531 Int) (v_DerPreprocessor_354 Int) (v_DerPreprocessor_356 Int)) (let ((.cse41 (* v_DerPreprocessor_428 4))) (let ((.cse38 (* v_DerPreprocessor_356 4)) (.cse40 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse41 |c_~#queue~0.offset|) v_DerPreprocessor_405)) (.cse35 (+ .cse41 |c_~#queue~0.offset| 4))) (let ((.cse39 (store .cse40 .cse35 v_DerPreprocessor_354)) (.cse37 (+ .cse38 |c_~#queue~0.offset|))) (let ((.cse30 (store .cse39 .cse37 v_prenex_533)) (.cse31 (+ .cse38 |c_~#queue~0.offset| 4))) (let ((.cse34 (store (store .cse40 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1))) (.cse36 (store (store .cse39 .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_356)) (.cse32 (store .cse30 .cse31 v_prenex_313)) (.cse33 (+ .cse38 |c_~#queue~0.offset| 8))) (or (not (= v_DerPreprocessor_428 .cse11)) (= (select (store (store (store .cse30 .cse9 (+ 3 v_DerPreprocessor_427)) .cse2 (+ v_DerPreprocessor_356 1)) .cse31 v_prenex_531) .cse2) 20) (= 20 (select (store (store (store .cse32 .cse9 (+ v_DerPreprocessor_427 4)) .cse2 (+ 2 v_DerPreprocessor_356)) .cse33 v_prenex_312) .cse2)) (= (select (store .cse34 .cse35 v_prenex_529) .cse2) 20) (= 20 (select (store .cse36 .cse37 v_prenex_530) .cse2)) (not (= (+ (select (store .cse34 .cse35 (select .cse36 .cse35)) .cse2) 1) v_DerPreprocessor_356)) (= (select (store (store (store (store .cse32 .cse33 v_prenex_311) .cse9 (+ 5 v_DerPreprocessor_427)) .cse2 (+ 3 v_DerPreprocessor_356)) (+ .cse38 |c_~#queue~0.offset| 12) v_prenex_314) .cse2) 20) (not (= .cse15 v_DerPreprocessor_427))))))))) (< .cse3 21)) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (not (= v_DerPreprocessor_428 .cse11)) (forall ((v_DerPreprocessor_415 Int) (v_DerPreprocessor_371 Int) (v_prenex_520 Int) (v_ArrVal_1167 Int) (v_DerPreprocessor_373 Int) (v_prenex_518 Int) (v_prenex_519 Int) (v_prenex_307 Int) (v_prenex_308 Int) (v_prenex_305 Int) (v_prenex_306 Int)) (let ((.cse53 (* v_DerPreprocessor_428 4))) (let ((.cse50 (* v_DerPreprocessor_373 4)) (.cse52 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse53 |c_~#queue~0.offset|) v_DerPreprocessor_415)) (.cse43 (+ .cse53 |c_~#queue~0.offset| 4))) (let ((.cse51 (store .cse52 .cse43 v_DerPreprocessor_371)) (.cse45 (+ .cse50 |c_~#queue~0.offset|))) (let ((.cse46 (store .cse51 .cse45 v_prenex_520)) (.cse47 (+ .cse50 |c_~#queue~0.offset| 4))) (let ((.cse42 (store (store .cse52 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1))) (.cse44 (store (store .cse51 .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_373)) (.cse48 (store .cse46 .cse47 v_prenex_307)) (.cse49 (+ .cse50 |c_~#queue~0.offset| 8))) (or (= (select (store .cse42 .cse43 v_prenex_518) .cse2) 20) (not (= v_DerPreprocessor_373 (+ (select (store .cse42 .cse43 (select .cse44 .cse43)) .cse2) 1))) (< v_DerPreprocessor_373 17) (= (select (store .cse44 .cse45 v_ArrVal_1167) .cse2) 20) (= (select (store (store (store .cse46 .cse9 (+ 3 v_DerPreprocessor_427)) .cse2 (+ v_DerPreprocessor_373 1)) .cse47 v_prenex_519) .cse2) 20) (= 20 (select (store (store (store .cse48 .cse9 (+ v_DerPreprocessor_427 4)) .cse2 (+ 2 v_DerPreprocessor_373)) .cse49 v_prenex_306) .cse2)) (= (select (store (store (store (store .cse48 .cse49 v_prenex_305) .cse9 (+ 5 v_DerPreprocessor_427)) .cse2 (+ 3 v_DerPreprocessor_373)) (+ .cse50 |c_~#queue~0.offset| 12) v_prenex_308) .cse2) 20)))))))) (not (= .cse15 v_DerPreprocessor_427)))) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (not (= v_DerPreprocessor_428 .cse11)) (forall ((v_DerPreprocessor_349 Int) (v_prenex_535 Int) (v_ArrVal_1174 Int) (v_DerPreprocessor_419 Int) (v_prenex_310 Int) (v_DerPreprocessor_351 Int) (v_prenex_241 Int) (v_prenex_309 Int)) (let ((.cse60 (* v_DerPreprocessor_428 4))) (let ((.cse54 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse60 |c_~#queue~0.offset|) v_DerPreprocessor_419)) (.cse55 (+ .cse60 |c_~#queue~0.offset| 4))) (let ((.cse56 (store .cse54 .cse55 v_DerPreprocessor_349)) (.cse59 (* v_DerPreprocessor_351 4))) (let ((.cse57 (store (store .cse56 (+ |c_~#queue~0.offset| .cse59) v_prenex_535) (+ |c_~#queue~0.offset| .cse59 4) v_prenex_310)) (.cse58 (+ |c_~#queue~0.offset| 8 .cse59))) (or (not (= v_DerPreprocessor_351 (+ (select (store (store (store .cse54 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1)) .cse55 (select (store (store .cse56 .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_351) .cse55)) .cse2) 1))) (not (= (select (store (store (store (store .cse57 .cse58 v_prenex_241) .cse9 (+ 5 v_DerPreprocessor_427)) .cse2 (+ 3 v_DerPreprocessor_351)) (+ |c_~#queue~0.offset| 12 .cse59) v_ArrVal_1174) .cse2) 20)) (= (select (store (store (store .cse57 .cse9 (+ v_DerPreprocessor_427 4)) .cse2 (+ 2 v_DerPreprocessor_351)) .cse58 v_prenex_309) .cse2) 20))))))) (not (= .cse15 v_DerPreprocessor_427)))) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (not (= v_DerPreprocessor_428 .cse11)) (forall ((v_DerPreprocessor_394 Int) (v_DerPreprocessor_396 Int) (v_DerPreprocessor_420 Int) (v_prenex_527 Int) (v_prenex_528 Int)) (let ((.cse65 (* v_DerPreprocessor_428 4))) (let ((.cse62 (+ .cse65 |c_~#queue~0.offset| 4)) (.cse64 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse65 |c_~#queue~0.offset|) v_DerPreprocessor_420))) (let ((.cse61 (store (store .cse64 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1))) (.cse63 (store (store (store .cse64 .cse62 v_DerPreprocessor_394) .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_396))) (or (not (= (+ (select (store .cse61 .cse62 (select .cse63 .cse62)) .cse2) 1) v_DerPreprocessor_396)) (= (select (store .cse61 .cse62 v_prenex_527) .cse2) 20) (not (= (select (store .cse63 (+ (* v_DerPreprocessor_396 4) |c_~#queue~0.offset|) v_prenex_528) .cse2) 20))))))) (not (= .cse15 v_DerPreprocessor_427)))) (not (= 21 .cse19)) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (not (= v_DerPreprocessor_428 .cse11)) (forall ((v_ArrVal_1163 Int) (v_DerPreprocessor_423 Int)) (not (= (select (let ((.cse66 (* v_DerPreprocessor_428 4))) (store (store (store (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse66 |c_~#queue~0.offset|) v_DerPreprocessor_423) .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1)) (+ .cse66 |c_~#queue~0.offset| 4) v_ArrVal_1163)) .cse2) 20))) (not (= .cse15 v_DerPreprocessor_427)))) (forall ((v_DerPreprocessor_426 Int) (v_DerPreprocessor_427 Int) (v_DerPreprocessor_428 Int)) (or (not (= v_DerPreprocessor_428 .cse11)) (forall ((v_ArrVal_1171 Int) (v_DerPreprocessor_416 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_322 Int) (v_DerPreprocessor_345 Int) (v_DerPreprocessor_334 Int) (v_DerPreprocessor_347 Int)) (let ((.cse73 (* v_DerPreprocessor_428 4))) (let ((.cse67 (store (store .cse0 .cse1 v_DerPreprocessor_426) (+ .cse73 |c_~#queue~0.offset|) v_DerPreprocessor_416)) (.cse68 (+ .cse73 |c_~#queue~0.offset| 4))) (let ((.cse69 (store .cse67 .cse68 v_DerPreprocessor_345)) (.cse72 (* v_DerPreprocessor_347 4))) (let ((.cse70 (store .cse69 (+ .cse72 |c_~#queue~0.offset|) v_DerPreprocessor_334)) (.cse71 (+ .cse72 |c_~#queue~0.offset| 4))) (or (not (= (+ (select (store (store (store .cse67 .cse9 (+ v_DerPreprocessor_427 1)) .cse2 (+ v_DerPreprocessor_428 1)) .cse68 (select (store (store .cse69 .cse9 (+ 2 v_DerPreprocessor_427)) .cse2 v_DerPreprocessor_347) .cse68)) .cse2) 1) v_DerPreprocessor_347)) (not (= (select (store (store (store (store .cse70 .cse71 v_DerPreprocessor_322) .cse9 (+ v_DerPreprocessor_427 4)) .cse2 (+ 2 v_DerPreprocessor_347)) (+ .cse72 |c_~#queue~0.offset| 8) v_ArrVal_1171) .cse2) 20)) (= (select (store (store (store .cse70 .cse9 (+ 3 v_DerPreprocessor_427)) .cse2 (+ v_DerPreprocessor_347 1)) .cse71 v_ArrVal_1169) .cse2) 20))))))) (not (= .cse15 v_DerPreprocessor_427))))))) (forall ((v_ArrVal_1158 Int)) (= (select (store .cse0 .cse1 v_ArrVal_1158) .cse2) 20))))))) is different from false [2024-06-27 17:50:03,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:50:03,704 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 899 treesize of output 643 [2024-06-27 17:51:01,962 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-27 17:51:05,981 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 (or (forall ((v_ArrVal_1152 Int)) (= (select (store .cse0 .cse1 v_ArrVal_1152) .cse2) 20)) (let ((.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse57 (select .cse0 (+ |c_~#queue~0.offset| 80))) (.cse7 (+ (select .cse0 .cse5) 1)) (.cse8 (+ .cse3 1))) (and (not (= 22 .cse3)) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse13 (* v_DerPreprocessor_438 4))) (let ((.cse4 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse6 (+ |c_~#queue~0.offset| .cse13))) (or (= (select (store (store (store .cse4 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse6 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)) (forall ((v_DerPreprocessor_394 Int) (v_prenex_691 Int) (v_DerPreprocessor_396 Int) (v_prenex_593 Int) (v_DerPreprocessor_420 Int) (v_prenex_527 Int) (v_prenex_528 Int)) (let ((.cse10 (+ |c_~#queue~0.offset| .cse13 12)) (.cse12 (store (store (store .cse4 .cse6 v_prenex_691) (+ |c_~#queue~0.offset| .cse13 4) v_prenex_593) (+ |c_~#queue~0.offset| 8 .cse13) v_DerPreprocessor_420))) (let ((.cse9 (store (store .cse12 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438))) (.cse11 (store (store (store .cse12 .cse10 v_DerPreprocessor_394) .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_396))) (or (not (= v_DerPreprocessor_396 (+ (select (store .cse9 .cse10 (select .cse11 .cse10)) .cse2) 1))) (= (select (store .cse9 .cse10 v_prenex_527) .cse2) 20) (not (= (select (store .cse11 (+ (* v_DerPreprocessor_396 4) |c_~#queue~0.offset|) v_prenex_528) .cse2) 20)))))))))) (forall ((v_DerPreprocessor_437 Int)) (or (not (= .cse3 20)) (not (= .cse7 v_DerPreprocessor_437)))) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse20 (* v_DerPreprocessor_438 4))) (let ((.cse21 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse22 (+ |c_~#queue~0.offset| .cse20))) (or (forall ((v_prenex_521 Int) (v_DerPreprocessor_391 Int) (v_prenex_522 Int) (v_prenex_592 Int) (v_DerPreprocessor_331 Int) (v_DerPreprocessor_431 Int) (v_DerPreprocessor_421 Int) (v_DerPreprocessor_389 Int)) (let ((.cse18 (store (store (store .cse21 .cse22 v_DerPreprocessor_431) (+ |c_~#queue~0.offset| .cse20 4) v_prenex_592) (+ |c_~#queue~0.offset| 8 .cse20) v_DerPreprocessor_421)) (.cse19 (+ |c_~#queue~0.offset| .cse20 12))) (let ((.cse16 (store .cse18 .cse19 v_DerPreprocessor_389)) (.cse17 (* v_DerPreprocessor_391 4))) (let ((.cse15 (+ |c_~#queue~0.offset| .cse17)) (.cse14 (store (store .cse16 .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_391))) (or (= (select (store .cse14 .cse15 v_prenex_521) .cse2) 20) (not (= (select (store (store (store (store .cse16 .cse15 v_DerPreprocessor_331) .cse5 (+ 5 v_DerPreprocessor_437)) .cse2 (+ v_DerPreprocessor_391 1)) (+ |c_~#queue~0.offset| 4 .cse17) v_prenex_522) .cse2) 20)) (not (= v_DerPreprocessor_391 (+ 1 (select (store (store (store .cse18 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438)) .cse19 (select .cse14 .cse19)) .cse2))))))))) (= (select (store (store (store .cse21 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse22 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)))))) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse31 (* v_DerPreprocessor_438 4))) (let ((.cse23 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse24 (+ |c_~#queue~0.offset| .cse31))) (or (= (select (store (store (store .cse23 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse24 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (forall ((v_DerPreprocessor_349 Int) (v_prenex_535 Int) (v_ArrVal_1174 Int) (v_DerPreprocessor_419 Int) (v_prenex_310 Int) (v_DerPreprocessor_351 Int) (v_prenex_692 Int) (v_prenex_241 Int) (v_prenex_309 Int) (v_prenex_591 Int)) (let ((.cse27 (store (store (store .cse23 .cse24 v_prenex_692) (+ |c_~#queue~0.offset| .cse31 4) v_prenex_591) (+ |c_~#queue~0.offset| 8 .cse31) v_DerPreprocessor_419)) (.cse28 (+ |c_~#queue~0.offset| .cse31 12))) (let ((.cse29 (store .cse27 .cse28 v_DerPreprocessor_349)) (.cse30 (* v_DerPreprocessor_351 4))) (let ((.cse25 (store (store .cse29 (+ |c_~#queue~0.offset| .cse30) v_prenex_535) (+ |c_~#queue~0.offset| .cse30 4) v_prenex_310)) (.cse26 (+ |c_~#queue~0.offset| 8 .cse30))) (or (= (select (store (store (store .cse25 .cse5 (+ v_DerPreprocessor_437 6)) .cse2 (+ 2 v_DerPreprocessor_351)) .cse26 v_prenex_309) .cse2) 20) (not (= v_DerPreprocessor_351 (+ (select (store (store (store .cse27 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438)) .cse28 (select (store (store .cse29 .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_351) .cse28)) .cse2) 1))) (not (= (select (store (store (store (store .cse25 .cse26 v_prenex_241) .cse5 (+ 7 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_351)) (+ |c_~#queue~0.offset| 12 .cse30) v_ArrVal_1174) .cse2) 20))))))) (not (= v_DerPreprocessor_438 .cse8)))))) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse38 (* v_DerPreprocessor_438 4))) (let ((.cse39 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse40 (+ |c_~#queue~0.offset| .cse38))) (or (forall ((v_DerPreprocessor_426 Int) (v_prenex_688 Int) (v_ArrVal_1171 Int) (v_DerPreprocessor_416 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_322 Int) (v_DerPreprocessor_345 Int) (v_DerPreprocessor_334 Int) (v_DerPreprocessor_347 Int)) (let ((.cse34 (store (store (store .cse39 .cse40 v_prenex_688) (+ |c_~#queue~0.offset| .cse38 4) v_DerPreprocessor_426) (+ |c_~#queue~0.offset| 8 .cse38) v_DerPreprocessor_416)) (.cse35 (+ |c_~#queue~0.offset| .cse38 12))) (let ((.cse36 (store .cse34 .cse35 v_DerPreprocessor_345)) (.cse37 (* v_DerPreprocessor_347 4))) (let ((.cse32 (store .cse36 (+ .cse37 |c_~#queue~0.offset|) v_DerPreprocessor_334)) (.cse33 (+ .cse37 |c_~#queue~0.offset| 4))) (or (= (select (store (store (store .cse32 .cse5 (+ 5 v_DerPreprocessor_437)) .cse2 (+ v_DerPreprocessor_347 1)) .cse33 v_ArrVal_1169) .cse2) 20) (not (= v_DerPreprocessor_347 (+ (select (store (store (store .cse34 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438)) .cse35 (select (store (store .cse36 .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_347) .cse35)) .cse2) 1))) (not (= (select (store (store (store (store .cse32 .cse33 v_DerPreprocessor_322) .cse5 (+ v_DerPreprocessor_437 6)) .cse2 (+ 2 v_DerPreprocessor_347)) (+ .cse37 |c_~#queue~0.offset| 8) v_ArrVal_1171) .cse2) 20))))))) (= (select (store (store (store .cse39 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse40 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)))))) (or (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_DerPreprocessor_405 Int) (v_prenex_529 Int) (v_prenex_314 Int) (v_prenex_598 Int) (v_prenex_312 Int) (v_prenex_533 Int) (v_prenex_313 Int) (v_prenex_695 Int) (v_prenex_530 Int) (v_prenex_311 Int) (v_prenex_531 Int) (v_ArrVal_1155 Int) (v_prenex_694 Int) (v_DerPreprocessor_354 Int) (v_DerPreprocessor_356 Int) (v_DerPreprocessor_436 Int)) (let ((.cse56 (* v_DerPreprocessor_438 4))) (let ((.cse48 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse49 (+ |c_~#queue~0.offset| .cse56))) (let ((.cse41 (store .cse48 .cse49 v_prenex_695)) (.cse42 (+ |c_~#queue~0.offset| .cse56 4))) (let ((.cse47 (* v_DerPreprocessor_356 4)) (.cse55 (store (store .cse41 .cse42 v_prenex_598) (+ |c_~#queue~0.offset| 8 .cse56) v_DerPreprocessor_405)) (.cse51 (+ |c_~#queue~0.offset| .cse56 12))) (let ((.cse54 (store .cse55 .cse51 v_DerPreprocessor_354)) (.cse53 (+ .cse47 |c_~#queue~0.offset|))) (let ((.cse45 (store .cse54 .cse53 v_prenex_533)) (.cse46 (+ .cse47 |c_~#queue~0.offset| 4))) (let ((.cse43 (store .cse45 .cse46 v_prenex_313)) (.cse44 (+ .cse47 |c_~#queue~0.offset| 8)) (.cse50 (store (store .cse55 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438))) (.cse52 (store (store .cse54 .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_356))) (or (= 20 (select (store (store (store .cse41 .cse5 (+ v_DerPreprocessor_437 1)) .cse2 (+ v_DerPreprocessor_438 1)) .cse42 v_prenex_694) .cse2)) (= (select (store (store (store .cse43 .cse5 (+ v_DerPreprocessor_437 6)) .cse2 (+ 2 v_DerPreprocessor_356)) .cse44 v_prenex_312) .cse2) 20) (= (select (store (store (store .cse45 .cse5 (+ 5 v_DerPreprocessor_437)) .cse2 (+ v_DerPreprocessor_356 1)) .cse46 v_prenex_531) .cse2) 20) (= (select (store (store (store (store .cse43 .cse44 v_prenex_311) .cse5 (+ 7 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_356)) (+ .cse47 |c_~#queue~0.offset| 12) v_prenex_314) .cse2) 20) (= (select (store (store (store .cse48 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse49 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (= (select (store .cse50 .cse51 v_prenex_529) .cse2) 20) (not (= (+ (select (store .cse50 .cse51 (select .cse52 .cse51)) .cse2) 1) v_DerPreprocessor_356)) (not (= v_DerPreprocessor_438 .cse8)) (= (select (store .cse52 .cse53 v_prenex_530) .cse2) 20)))))))))) (< .cse57 21)) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse71 (* v_DerPreprocessor_438 4))) (let ((.cse72 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse73 (+ |c_~#queue~0.offset| .cse71))) (or (forall ((v_DerPreprocessor_415 Int) (v_prenex_518 Int) (v_prenex_519 Int) (v_prenex_307 Int) (v_prenex_308 Int) (v_prenex_305 Int) (v_prenex_306 Int) (v_prenex_697 Int) (v_prenex_698 Int) (v_prenex_596 Int) (v_DerPreprocessor_371 Int) (v_prenex_520 Int) (v_ArrVal_1167 Int) (v_DerPreprocessor_373 Int)) (let ((.cse65 (store .cse72 .cse73 v_prenex_698)) (.cse66 (+ |c_~#queue~0.offset| .cse71 4))) (let ((.cse64 (* v_DerPreprocessor_373 4)) (.cse69 (store (store .cse65 .cse66 v_prenex_596) (+ |c_~#queue~0.offset| 8 .cse71) v_DerPreprocessor_415)) (.cse61 (+ |c_~#queue~0.offset| .cse71 12))) (let ((.cse70 (store .cse69 .cse61 v_DerPreprocessor_371)) (.cse59 (+ .cse64 |c_~#queue~0.offset|))) (let ((.cse67 (store .cse70 .cse59 v_prenex_520)) (.cse68 (+ .cse64 |c_~#queue~0.offset| 4))) (let ((.cse58 (store (store .cse70 .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_373)) (.cse62 (store .cse67 .cse68 v_prenex_307)) (.cse63 (+ .cse64 |c_~#queue~0.offset| 8)) (.cse60 (store (store .cse69 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438)))) (or (= (select (store .cse58 .cse59 v_ArrVal_1167) .cse2) 20) (not (= v_DerPreprocessor_373 (+ (select (store .cse60 .cse61 (select .cse58 .cse61)) .cse2) 1))) (= (select (store (store (store (store .cse62 .cse63 v_prenex_305) .cse5 (+ 7 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_373)) (+ .cse64 |c_~#queue~0.offset| 12) v_prenex_308) .cse2) 20) (= (select (store (store (store .cse65 .cse5 (+ v_DerPreprocessor_437 1)) .cse2 (+ v_DerPreprocessor_438 1)) .cse66 v_prenex_697) .cse2) 20) (= (select (store (store (store .cse67 .cse5 (+ 5 v_DerPreprocessor_437)) .cse2 (+ v_DerPreprocessor_373 1)) .cse68 v_prenex_519) .cse2) 20) (< v_DerPreprocessor_373 17) (= 20 (select (store (store (store .cse62 .cse5 (+ v_DerPreprocessor_437 6)) .cse2 (+ 2 v_DerPreprocessor_373)) .cse63 v_prenex_306) .cse2)) (= (select (store .cse60 .cse61 v_prenex_518) .cse2) 20)))))))) (= (select (store (store (store .cse72 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse73 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)))))) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse76 (* v_DerPreprocessor_438 4))) (let ((.cse77 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse78 (+ |c_~#queue~0.offset| .cse76))) (or (forall ((v_DerPreprocessor_338 Int) (v_prenex_689 Int) (v_DerPreprocessor_418 Int) (v_prenex_597 Int) (v_DerPreprocessor_336 Int)) (or (< 0 (+ 5 v_DerPreprocessor_338)) (not (= (+ (select (let ((.cse74 (store (store (store .cse77 .cse78 v_prenex_689) (+ |c_~#queue~0.offset| .cse76 4) v_prenex_597) (+ |c_~#queue~0.offset| 8 .cse76) v_DerPreprocessor_418)) (.cse75 (+ |c_~#queue~0.offset| .cse76 12))) (store (store (store .cse74 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438)) .cse75 (select (store (store (store .cse74 .cse75 v_DerPreprocessor_336) .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_338) .cse75))) .cse2) 1) v_DerPreprocessor_338)))) (= (select (store (store (store .cse77 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse78 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)))))) (forall ((v_DerPreprocessor_437 Int)) (or (not (= .cse3 17)) (not (= .cse7 v_DerPreprocessor_437)))) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse81 (* v_DerPreprocessor_438 4))) (let ((.cse79 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse80 (+ |c_~#queue~0.offset| .cse81))) (or (= (select (store (store (store .cse79 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse80 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)) (forall ((v_ArrVal_1163 Int) (v_prenex_696 Int) (v_prenex_594 Int) (v_DerPreprocessor_423 Int)) (not (= (select (store (store (store (store (store (store .cse79 .cse80 v_prenex_696) (+ |c_~#queue~0.offset| .cse81 4) v_prenex_594) (+ |c_~#queue~0.offset| 8 .cse81) v_DerPreprocessor_423) .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438)) (+ |c_~#queue~0.offset| .cse81 12) v_ArrVal_1163) .cse2) 20))))))) (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_436 Int)) (let ((.cse84 (* v_DerPreprocessor_438 4))) (let ((.cse82 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse83 (+ |c_~#queue~0.offset| .cse84))) (or (= (select (store (store (store .cse82 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse83 v_ArrVal_1155) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (not (= v_DerPreprocessor_438 .cse8)) (forall ((v_prenex_693 Int) (v_ArrVal_1158 Int)) (not (= (select (store (store (store (store .cse82 .cse83 v_prenex_693) .cse5 (+ v_DerPreprocessor_437 1)) .cse2 (+ v_DerPreprocessor_438 1)) (+ |c_~#queue~0.offset| .cse84 4) v_ArrVal_1158) .cse2) 20))))))) (or (forall ((v_DerPreprocessor_437 Int) (v_DerPreprocessor_438 Int) (v_DerPreprocessor_317 Int) (v_prenex_228 Int) (v_prenex_525 Int) (v_prenex_526 Int) (v_prenex_523 Int) (v_prenex_524 Int) (v_prenex_304 Int) (v_prenex_599 Int) (v_DerPreprocessor_380 Int) (v_ArrVal_1155 Int) (v_prenex_595 Int) (v_prenex_690 Int) (v_DerPreprocessor_400 Int) (v_DerPreprocessor_378 Int) (v_DerPreprocessor_325 Int) (v_DerPreprocessor_436 Int)) (let ((.cse100 (* v_DerPreprocessor_438 4))) (let ((.cse91 (store .cse0 .cse1 v_DerPreprocessor_436)) (.cse92 (+ |c_~#queue~0.offset| .cse100))) (let ((.cse96 (store .cse91 .cse92 v_prenex_690)) (.cse97 (+ |c_~#queue~0.offset| .cse100 4))) (let ((.cse90 (* v_DerPreprocessor_380 4)) (.cse99 (store (store .cse96 .cse97 v_prenex_595) (+ |c_~#queue~0.offset| 8 .cse100) v_DerPreprocessor_400)) (.cse86 (+ |c_~#queue~0.offset| .cse100 12))) (let ((.cse98 (store .cse99 .cse86 v_DerPreprocessor_378)) (.cse93 (+ .cse90 |c_~#queue~0.offset|))) (let ((.cse94 (store .cse98 .cse93 v_prenex_526)) (.cse95 (+ .cse90 |c_~#queue~0.offset| 4))) (let ((.cse85 (store (store .cse99 .cse5 (+ 3 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_438))) (.cse88 (store .cse94 .cse95 v_DerPreprocessor_325)) (.cse89 (+ .cse90 |c_~#queue~0.offset| 8)) (.cse87 (store (store .cse98 .cse5 (+ v_DerPreprocessor_437 4)) .cse2 v_DerPreprocessor_380))) (or (not (= v_DerPreprocessor_380 (+ (select (store .cse85 .cse86 (select .cse87 .cse86)) .cse2) 1))) (= (select (store (store (store (store .cse88 .cse89 v_DerPreprocessor_317) .cse5 (+ 7 v_DerPreprocessor_437)) .cse2 (+ 3 v_DerPreprocessor_380)) (+ .cse90 |c_~#queue~0.offset| 12) v_prenex_228) .cse2) 20) (= (select (store (store (store .cse91 .cse5 v_DerPreprocessor_437) .cse2 v_DerPreprocessor_438) .cse92 v_ArrVal_1155) .cse2) 20) (= (select (store .cse85 .cse86 v_prenex_523) .cse2) 20) (not (= .cse7 v_DerPreprocessor_437)) (= 20 (select (store (store (store .cse88 .cse5 (+ v_DerPreprocessor_437 6)) .cse2 (+ 2 v_DerPreprocessor_380)) .cse89 v_prenex_304) .cse2)) (= (select (store .cse87 .cse93 v_prenex_524) .cse2) 20) (not (= v_DerPreprocessor_438 .cse8)) (= (select (store (store (store .cse94 .cse5 (+ 5 v_DerPreprocessor_437)) .cse2 (+ v_DerPreprocessor_380 1)) .cse95 v_prenex_525) .cse2) 20) (= 20 (select (store (store (store .cse96 .cse5 (+ v_DerPreprocessor_437 1)) .cse2 (+ v_DerPreprocessor_438 1)) .cse97 v_prenex_599) .cse2))))))))))) (< 0 (+ .cse57 1))) (not (= 21 .cse3)) (forall ((v_DerPreprocessor_439 Int) (v_ArrVal_1155 Int) (v_DerPreprocessor_440 Int) (v_DerPreprocessor_441 Int)) (or (not (= .cse7 v_DerPreprocessor_440)) (not (= 20 (select (store (store (store (store .cse0 .cse1 v_DerPreprocessor_439) .cse5 v_DerPreprocessor_440) .cse2 v_DerPreprocessor_441) (+ (* v_DerPreprocessor_441 4) |c_~#queue~0.offset|) v_ArrVal_1155) .cse2))) (not (= v_DerPreprocessor_441 .cse8)))))))) (forall ((v_ArrVal_1152 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_1152) .cse2) 20))))))) is different from false [2024-06-27 17:51:07,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:51:07,017 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 1371 treesize of output 911 [2024-06-27 17:51:07,055 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-27 17:51:11,075 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 ((.cse36 (select .cse0 .cse2))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse102 (* .cse36 4))) (let ((.cse1 (+ .cse102 |c_~#queue~0.offset|)) (.cse103 (select .cse0 .cse5))) (let ((.cse28 (+ .cse36 1)) (.cse21 (+ .cse102 |c_~#queue~0.offset| 4)) (.cse27 (+ .cse103 1)) (.cse101 (not (= 21 .cse36))) (.cse104 (forall ((v_ArrVal_1147 Int)) (= (select (store .cse0 .cse1 v_ArrVal_1147) .cse2) 20)))) (and (forall ((v_ArrVal_1147 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_1147) .cse2) 20))) (or (let ((.cse35 (select .cse0 (+ |c_~#queue~0.offset| 80))) (.cse6 (+ 9 .cse103)) (.cse19 (+ .cse103 8)) (.cse32 (+ 5 .cse103)) (.cse33 (+ 5 .cse36)) (.cse9 (+ 7 .cse103)) (.cse30 (+ 6 .cse103)) (.cse23 (+ .cse102 |c_~#queue~0.offset| 20)) (.cse34 (+ .cse102 16 |c_~#queue~0.offset|)) (.cse12 (+ 2 .cse103)) (.cse13 (+ 2 .cse36)) (.cse14 (+ .cse102 |c_~#queue~0.offset| 8)) (.cse16 (+ 3 .cse103)) (.cse17 (+ 3 .cse36)) (.cse18 (+ .cse102 |c_~#queue~0.offset| 12))) (and (or (forall ((v_DerPreprocessor_405 Int) (v_prenex_815 Int) (v_prenex_529 Int) (v_prenex_816 Int) (v_prenex_314 Int) (v_prenex_598 Int) (v_ArrVal_1152 Int) (v_prenex_312 Int) (v_prenex_533 Int) (v_prenex_313 Int) (v_prenex_695 Int) (v_prenex_530 Int) (v_prenex_531 Int) (v_prenex_311 Int) (v_prenex_694 Int) (v_DerPreprocessor_354 Int) (v_DerPreprocessor_444 Int) (v_DerPreprocessor_356 Int)) (let ((.cse26 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse11 (store .cse26 .cse21 v_prenex_816))) (let ((.cse15 (store .cse11 .cse14 v_prenex_695))) (let ((.cse7 (* v_DerPreprocessor_356 4)) (.cse31 (store (store .cse15 .cse18 v_prenex_598) .cse34 v_DerPreprocessor_405))) (let ((.cse29 (store .cse31 .cse23 v_DerPreprocessor_354)) (.cse25 (+ .cse7 |c_~#queue~0.offset|))) (let ((.cse8 (store .cse29 .cse25 v_prenex_533)) (.cse10 (+ .cse7 |c_~#queue~0.offset| 4))) (let ((.cse3 (store .cse8 .cse10 v_prenex_313)) (.cse4 (+ .cse7 |c_~#queue~0.offset| 8)) (.cse22 (store (store .cse31 .cse5 .cse32) .cse2 .cse33)) (.cse24 (store (store .cse29 .cse5 .cse30) .cse2 v_DerPreprocessor_356)) (.cse20 (store (store .cse26 .cse5 .cse27) .cse2 .cse28))) (or (= (select (store (store (store (store .cse3 .cse4 v_prenex_311) .cse5 .cse6) .cse2 (+ 3 v_DerPreprocessor_356)) (+ .cse7 |c_~#queue~0.offset| 12) v_prenex_314) .cse2) 20) (= (select (store (store (store .cse8 .cse5 .cse9) .cse2 (+ v_DerPreprocessor_356 1)) .cse10 v_prenex_531) .cse2) 20) (= (select (store (store (store .cse11 .cse5 .cse12) .cse2 .cse13) .cse14 v_prenex_815) .cse2) 20) (= (select (store (store (store .cse15 .cse5 .cse16) .cse2 .cse17) .cse18 v_prenex_694) .cse2) 20) (= (select (store (store (store .cse3 .cse5 .cse19) .cse2 (+ 2 v_DerPreprocessor_356)) .cse4 v_prenex_312) .cse2) 20) (= (select (store .cse20 .cse21 v_ArrVal_1152) .cse2) 20) (= (select (store .cse22 .cse23 v_prenex_529) .cse2) 20) (= (select (store .cse24 .cse25 v_prenex_530) .cse2) 20) (not (= (+ (select (store .cse22 .cse23 (select .cse24 .cse23)) .cse2) 1) v_DerPreprocessor_356)) (not (= (select .cse20 .cse1) v_DerPreprocessor_444))))))))))) (< .cse35 21)) (not (= 22 .cse36)) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse37 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse38 (store (store .cse37 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_prenex_810 Int) (v_DerPreprocessor_439 Int)) (not (= (select (store (store (store (store .cse37 .cse21 v_DerPreprocessor_439) .cse5 .cse12) .cse2 .cse13) .cse14 v_prenex_810) .cse2) 20))) (= (select (store .cse38 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse38 .cse1) v_DerPreprocessor_444)))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse39 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse40 (store (store .cse39 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_ArrVal_1163 Int) (v_prenex_696 Int) (v_prenex_594 Int) (v_DerPreprocessor_423 Int) (v_prenex_812 Int)) (not (= 20 (select (store (store (store (store (store (store (store .cse39 .cse21 v_prenex_812) .cse14 v_prenex_696) .cse18 v_prenex_594) .cse34 v_DerPreprocessor_423) .cse5 .cse32) .cse2 .cse33) .cse23 v_ArrVal_1163) .cse2)))) (= (select (store .cse40 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse40 .cse1) v_DerPreprocessor_444)))))) (or (< 0 (+ .cse35 1)) (forall ((v_DerPreprocessor_317 Int) (v_prenex_817 Int) (v_prenex_818 Int) (v_prenex_525 Int) (v_prenex_228 Int) (v_prenex_526 Int) (v_prenex_523 Int) (v_prenex_524 Int) (v_prenex_304 Int) (v_ArrVal_1152 Int) (v_prenex_599 Int) (v_DerPreprocessor_380 Int) (v_prenex_595 Int) (v_prenex_690 Int) (v_DerPreprocessor_444 Int) (v_DerPreprocessor_400 Int) (v_DerPreprocessor_378 Int) (v_DerPreprocessor_325 Int)) (let ((.cse52 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse50 (store .cse52 .cse21 v_prenex_818))) (let ((.cse49 (store .cse50 .cse14 v_prenex_690))) (let ((.cse48 (* v_DerPreprocessor_380 4)) (.cse53 (store (store .cse49 .cse18 v_prenex_595) .cse34 v_DerPreprocessor_400))) (let ((.cse54 (store .cse53 .cse23 v_DerPreprocessor_378)) (.cse43 (+ .cse48 |c_~#queue~0.offset|))) (let ((.cse44 (store .cse54 .cse43 v_prenex_526)) (.cse45 (+ .cse48 |c_~#queue~0.offset| 4))) (let ((.cse42 (store (store .cse54 .cse5 .cse30) .cse2 v_DerPreprocessor_380)) (.cse41 (store (store .cse53 .cse5 .cse32) .cse2 .cse33)) (.cse46 (store .cse44 .cse45 v_DerPreprocessor_325)) (.cse47 (+ .cse48 |c_~#queue~0.offset| 8)) (.cse51 (store (store .cse52 .cse5 .cse27) .cse2 .cse28))) (or (not (= (+ (select (store .cse41 .cse23 (select .cse42 .cse23)) .cse2) 1) v_DerPreprocessor_380)) (= (select (store .cse42 .cse43 v_prenex_524) .cse2) 20) (= (select (store (store (store .cse44 .cse5 .cse9) .cse2 (+ v_DerPreprocessor_380 1)) .cse45 v_prenex_525) .cse2) 20) (= (select (store (store (store (store .cse46 .cse47 v_DerPreprocessor_317) .cse5 .cse6) .cse2 (+ 3 v_DerPreprocessor_380)) (+ .cse48 |c_~#queue~0.offset| 12) v_prenex_228) .cse2) 20) (= (select (store (store (store .cse49 .cse5 .cse16) .cse2 .cse17) .cse18 v_prenex_599) .cse2) 20) (= (select (store (store (store .cse50 .cse5 .cse12) .cse2 .cse13) .cse14 v_prenex_817) .cse2) 20) (= 20 (select (store .cse41 .cse23 v_prenex_523) .cse2)) (= (select (store .cse51 .cse21 v_ArrVal_1152) .cse2) 20) (= (select (store (store (store .cse46 .cse5 .cse19) .cse2 (+ 2 v_DerPreprocessor_380)) .cse47 v_prenex_304) .cse2) 20) (not (= (select .cse51 .cse1) v_DerPreprocessor_444)))))))))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse56 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse57 (store (store .cse56 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_DerPreprocessor_338 Int) (v_prenex_820 Int) (v_prenex_689 Int) (v_DerPreprocessor_418 Int) (v_prenex_597 Int) (v_DerPreprocessor_336 Int)) (or (not (= (+ (select (let ((.cse55 (store (store (store (store .cse56 .cse21 v_prenex_820) .cse14 v_prenex_689) .cse18 v_prenex_597) .cse34 v_DerPreprocessor_418))) (store (store (store .cse55 .cse5 .cse32) .cse2 .cse33) .cse23 (select (store (store (store .cse55 .cse23 v_DerPreprocessor_336) .cse5 .cse30) .cse2 v_DerPreprocessor_338) .cse23))) .cse2) 1) v_DerPreprocessor_338)) (< 0 (+ 5 v_DerPreprocessor_338)))) (= (select (store .cse57 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse57 .cse1) v_DerPreprocessor_444)))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse63 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse64 (store (store .cse63 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_DerPreprocessor_426 Int) (v_prenex_688 Int) (v_ArrVal_1171 Int) (v_DerPreprocessor_416 Int) (v_ArrVal_1169 Int) (v_DerPreprocessor_322 Int) (v_DerPreprocessor_345 Int) (v_DerPreprocessor_334 Int) (v_prenex_814 Int) (v_DerPreprocessor_347 Int)) (let ((.cse58 (store (store (store (store .cse63 .cse21 v_prenex_814) .cse14 v_prenex_688) .cse18 v_DerPreprocessor_426) .cse34 v_DerPreprocessor_416))) (let ((.cse59 (store .cse58 .cse23 v_DerPreprocessor_345)) (.cse62 (* v_DerPreprocessor_347 4))) (let ((.cse60 (store .cse59 (+ .cse62 |c_~#queue~0.offset|) v_DerPreprocessor_334)) (.cse61 (+ .cse62 |c_~#queue~0.offset| 4))) (or (not (= (+ (select (store (store (store .cse58 .cse5 .cse32) .cse2 .cse33) .cse23 (select (store (store .cse59 .cse5 .cse30) .cse2 v_DerPreprocessor_347) .cse23)) .cse2) 1) v_DerPreprocessor_347)) (not (= 20 (select (store (store (store (store .cse60 .cse61 v_DerPreprocessor_322) .cse5 .cse19) .cse2 (+ 2 v_DerPreprocessor_347)) (+ .cse62 |c_~#queue~0.offset| 8) v_ArrVal_1171) .cse2))) (= (select (store (store (store .cse60 .cse5 .cse9) .cse2 (+ v_DerPreprocessor_347 1)) .cse61 v_ArrVal_1169) .cse2) 20)))))) (= (select (store .cse64 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse64 .cse1) v_DerPreprocessor_444)))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse77 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse78 (store (store .cse77 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_DerPreprocessor_415 Int) (v_prenex_518 Int) (v_prenex_826 Int) (v_prenex_519 Int) (v_prenex_307 Int) (v_prenex_308 Int) (v_prenex_825 Int) (v_prenex_305 Int) (v_prenex_306 Int) (v_prenex_697 Int) (v_prenex_698 Int) (v_prenex_596 Int) (v_prenex_520 Int) (v_DerPreprocessor_371 Int) (v_ArrVal_1167 Int) (v_DerPreprocessor_373 Int)) (let ((.cse66 (store .cse77 .cse21 v_prenex_826))) (let ((.cse65 (store .cse66 .cse14 v_prenex_698))) (let ((.cse74 (* v_DerPreprocessor_373 4)) (.cse76 (store (store .cse65 .cse18 v_prenex_596) .cse34 v_DerPreprocessor_415))) (let ((.cse75 (store .cse76 .cse23 v_DerPreprocessor_371)) (.cse71 (+ .cse74 |c_~#queue~0.offset|))) (let ((.cse67 (store .cse75 .cse71 v_prenex_520)) (.cse68 (+ .cse74 |c_~#queue~0.offset| 4))) (let ((.cse72 (store .cse67 .cse68 v_prenex_307)) (.cse73 (+ .cse74 |c_~#queue~0.offset| 8)) (.cse69 (store (store .cse76 .cse5 .cse32) .cse2 .cse33)) (.cse70 (store (store .cse75 .cse5 .cse30) .cse2 v_DerPreprocessor_373))) (or (= (select (store (store (store .cse65 .cse5 .cse16) .cse2 .cse17) .cse18 v_prenex_697) .cse2) 20) (= 20 (select (store (store (store .cse66 .cse5 .cse12) .cse2 .cse13) .cse14 v_prenex_825) .cse2)) (< v_DerPreprocessor_373 17) (= 20 (select (store (store (store .cse67 .cse5 .cse9) .cse2 (+ v_DerPreprocessor_373 1)) .cse68 v_prenex_519) .cse2)) (= 20 (select (store .cse69 .cse23 v_prenex_518) .cse2)) (= 20 (select (store .cse70 .cse71 v_ArrVal_1167) .cse2)) (= (select (store (store (store .cse72 .cse5 .cse19) .cse2 (+ 2 v_DerPreprocessor_373)) .cse73 v_prenex_306) .cse2) 20) (= 20 (select (store (store (store (store .cse72 .cse73 v_prenex_305) .cse5 .cse6) .cse2 (+ 3 v_DerPreprocessor_373)) (+ .cse74 |c_~#queue~0.offset| 12) v_prenex_308) .cse2)) (not (= v_DerPreprocessor_373 (+ (select (store .cse69 .cse23 (select .cse70 .cse23)) .cse2) 1))))))))))) (= (select (store .cse78 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse78 .cse1) v_DerPreprocessor_444)))))) (not (= .cse36 20)) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse84 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse85 (store (store .cse84 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_DerPreprocessor_349 Int) (v_prenex_535 Int) (v_ArrVal_1174 Int) (v_DerPreprocessor_419 Int) (v_prenex_310 Int) (v_DerPreprocessor_351 Int) (v_prenex_692 Int) (v_prenex_241 Int) (v_prenex_309 Int) (v_prenex_591 Int) (v_prenex_824 Int)) (let ((.cse82 (store (store (store (store .cse84 .cse21 v_prenex_824) .cse14 v_prenex_692) .cse18 v_prenex_591) .cse34 v_DerPreprocessor_419))) (let ((.cse83 (store .cse82 .cse23 v_DerPreprocessor_349)) (.cse81 (* v_DerPreprocessor_351 4))) (let ((.cse79 (store (store .cse83 (+ |c_~#queue~0.offset| .cse81) v_prenex_535) (+ |c_~#queue~0.offset| .cse81 4) v_prenex_310)) (.cse80 (+ |c_~#queue~0.offset| 8 .cse81))) (or (not (= (select (store (store (store (store .cse79 .cse80 v_prenex_241) .cse5 .cse6) .cse2 (+ 3 v_DerPreprocessor_351)) (+ |c_~#queue~0.offset| 12 .cse81) v_ArrVal_1174) .cse2) 20)) (not (= v_DerPreprocessor_351 (+ (select (store (store (store .cse82 .cse5 .cse32) .cse2 .cse33) .cse23 (select (store (store .cse83 .cse5 .cse30) .cse2 v_DerPreprocessor_351) .cse23)) .cse2) 1))) (= (select (store (store (store .cse79 .cse5 .cse19) .cse2 (+ 2 v_DerPreprocessor_351)) .cse80 v_prenex_309) .cse2) 20)))))) (= (select (store .cse85 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse85 .cse1) v_DerPreprocessor_444)))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse89 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse90 (store (store .cse89 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_DerPreprocessor_394 Int) (v_prenex_691 Int) (v_DerPreprocessor_396 Int) (v_prenex_828 Int) (v_prenex_593 Int) (v_DerPreprocessor_420 Int) (v_prenex_527 Int) (v_prenex_528 Int)) (let ((.cse88 (store (store (store (store .cse89 .cse21 v_prenex_828) .cse14 v_prenex_691) .cse18 v_prenex_593) .cse34 v_DerPreprocessor_420))) (let ((.cse87 (store (store .cse88 .cse5 .cse32) .cse2 .cse33)) (.cse86 (store (store (store .cse88 .cse23 v_DerPreprocessor_394) .cse5 .cse30) .cse2 v_DerPreprocessor_396))) (or (not (= (select (store .cse86 (+ (* v_DerPreprocessor_396 4) |c_~#queue~0.offset|) v_prenex_528) .cse2) 20)) (= 20 (select (store .cse87 .cse23 v_prenex_527) .cse2)) (not (= v_DerPreprocessor_396 (+ (select (store .cse87 .cse23 (select .cse86 .cse23)) .cse2) 1))))))) (= (select (store .cse90 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse90 .cse1) v_DerPreprocessor_444)))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse96 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse97 (store (store .cse96 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_prenex_521 Int) (v_prenex_522 Int) (v_DerPreprocessor_391 Int) (v_prenex_592 Int) (v_DerPreprocessor_331 Int) (v_DerPreprocessor_431 Int) (v_DerPreprocessor_421 Int) (v_DerPreprocessor_389 Int) (v_DerPreprocessor_436 Int)) (let ((.cse91 (store (store (store (store .cse96 .cse21 v_DerPreprocessor_436) .cse14 v_DerPreprocessor_431) .cse18 v_prenex_592) .cse34 v_DerPreprocessor_421))) (let ((.cse95 (* v_DerPreprocessor_391 4)) (.cse93 (store .cse91 .cse23 v_DerPreprocessor_389))) (let ((.cse92 (store (store .cse93 .cse5 .cse30) .cse2 v_DerPreprocessor_391)) (.cse94 (+ |c_~#queue~0.offset| .cse95))) (or (not (= v_DerPreprocessor_391 (+ (select (store (store (store .cse91 .cse5 .cse32) .cse2 .cse33) .cse23 (select .cse92 .cse23)) .cse2) 1))) (not (= (select (store (store (store (store .cse93 .cse94 v_DerPreprocessor_331) .cse5 .cse9) .cse2 (+ v_DerPreprocessor_391 1)) (+ |c_~#queue~0.offset| 4 .cse95) v_prenex_522) .cse2) 20)) (= (select (store .cse92 .cse94 v_prenex_521) .cse2) 20)))))) (= (select (store .cse97 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse97 .cse1) v_DerPreprocessor_444)))))) (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_444 Int)) (let ((.cse99 (store .cse0 .cse1 v_DerPreprocessor_444))) (let ((.cse100 (store (store .cse99 .cse5 .cse27) .cse2 .cse28))) (or (forall ((v_prenex_821 Int) (v_prenex_693 Int) (v_ArrVal_1158 Int) (v_prenex_822 Int)) (let ((.cse98 (store .cse99 .cse21 v_prenex_822))) (or (= 20 (select (store (store (store .cse98 .cse5 .cse12) .cse2 .cse13) .cse14 v_prenex_821) .cse2)) (not (= (select (store (store (store (store .cse98 .cse14 v_prenex_693) .cse5 .cse16) .cse2 .cse17) .cse18 v_ArrVal_1158) .cse2) 20))))) (= (select (store .cse100 .cse21 v_ArrVal_1152) .cse2) 20) (not (= (select .cse100 .cse1) v_DerPreprocessor_444)))))) .cse101 (not (= 16 .cse36)))) .cse104) (or (and (forall ((v_DerPreprocessor_449 Int) (v_ArrVal_1152 Int)) (not (= 20 (select (store (store (store (store .cse0 .cse1 v_DerPreprocessor_449) .cse5 .cse27) .cse2 .cse28) .cse21 v_ArrVal_1152) .cse2)))) (or (forall ((v_ArrVal_1152 Int) (v_DerPreprocessor_447 Int)) (not (= 20 (select (store (store (store .cse0 .cse5 .cse27) .cse2 v_DerPreprocessor_447) (+ |c_~#queue~0.offset| (* v_DerPreprocessor_447 4)) v_ArrVal_1152) .cse2)))) .cse101)) .cse104))))))) is different from false [2024-06-27 17:51:11,261 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 27 treesize of output 23 [2024-06-27 17:51:11,287 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-27 17:51:11,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:51:11,427 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 2547 treesize of output 1571 [2024-06-27 17:51:13,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 30 treesize of output 18 [2024-06-27 17:52:39,619 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 38 [2024-06-27 17:52:39,642 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 78 treesize of output 58 [2024-06-27 17:52:39,777 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 240 treesize of output 160 [2024-06-27 17:52:40,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-27 17:52:40,081 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 85 treesize of output 49 [2024-06-27 17:52:40,099 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 249 treesize of output 165 [2024-06-27 17:52:40,221 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-27 17:52:40,251 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 149 treesize of output 93 [2024-06-27 17:52:40,289 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-27 17:52:40,301 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 137 treesize of output 93 [2024-06-27 17:52:40,371 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 137 treesize of output 93 [2024-06-27 17:52:40,465 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 306 treesize of output 198 [2024-06-27 17:52:40,495 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-27 17:55:07,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse14 (select .cse12 .cse4))) (let ((.cse103 (* .cse14 4)) (.cse104 (select .cse12 .cse2))) (let ((.cse66 (select .cse12 (+ |c_~#queue~0.offset| 80))) (.cse17 (+ .cse104 10)) (.cse7 (+ .cse104 1)) (.cse8 (+ .cse14 1)) (.cse40 (+ .cse104 11)) (.cse19 (+ 9 .cse104)) (.cse11 (+ 2 .cse104)) (.cse49 (+ 2 .cse14)) (.cse3 (+ 3 .cse104)) (.cse32 (+ 3 .cse14)) (.cse25 (+ .cse104 8)) (.cse30 (+ .cse103 |c_~#queue~0.offset| 24)) (.cse21 (+ 7 .cse104)) (.cse22 (+ 7 .cse14)) (.cse23 (+ .cse103 |c_~#queue~0.offset| 28)) (.cse53 (+ 5 .cse104)) (.cse54 (+ 5 .cse14)) (.cse29 (+ .cse103 |c_~#queue~0.offset| 20)) (.cse33 (+ .cse104 4)) (.cse34 (+ .cse14 4)) (.cse28 (+ .cse103 16 |c_~#queue~0.offset|)) (.cse13 (+ .cse103 |c_~#queue~0.offset|)) (.cse9 (+ .cse103 |c_~#queue~0.offset| 4)) (.cse26 (+ .cse103 |c_~#queue~0.offset| 8)) (.cse27 (+ .cse103 |c_~#queue~0.offset| 12))) (and (forall ((v_DerPreprocessor_459 Int) (v_DerPreprocessor_449 Int) (v_ArrVal_1152 Int) (v_DerPreprocessor_480 Int) (v_DerPreprocessor_461 Int) (v_ArrVal_1147 Int)) (let ((.cse6 (store .cse12 .cse13 v_DerPreprocessor_480))) (let ((.cse5 (* v_DerPreprocessor_461 4)) (.cse0 (store .cse6 .cse9 v_DerPreprocessor_459))) (let ((.cse10 (store (store .cse0 .cse2 .cse11) .cse4 v_DerPreprocessor_461)) (.cse1 (+ .cse5 |c_~#queue~0.offset|))) (or (not (= (select (store (store (store (store .cse0 .cse1 v_DerPreprocessor_449) .cse2 .cse3) .cse4 (+ v_DerPreprocessor_461 1)) (+ .cse5 |c_~#queue~0.offset| 4) v_ArrVal_1152) .cse4) 20)) (not (= v_DerPreprocessor_461 (+ (select (store (store (store .cse6 .cse2 .cse7) .cse4 .cse8) .cse9 (select .cse10 .cse9)) .cse4) 1))) (= 20 (select (store .cse10 .cse1 v_ArrVal_1147) .cse4))))))) (not (= 22 .cse14)) (forall ((v_DerPreprocessor_503 Int) (v_DerPreprocessor_426 Int) (v_DerPreprocessor_416 Int) (v_prenex_814 Int) (v_prenex_688 Int) (v_ArrVal_1171 Int) (v_ArrVal_1169 Int) (v_prenex_1021 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_322 Int) (v_DerPreprocessor_345 Int) (v_DerPreprocessor_334 Int) (v_DerPreprocessor_347 Int)) (let ((.cse20 (store (store (store (store (store (store (store .cse12 .cse13 v_DerPreprocessor_503) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1021) .cse27 v_prenex_814) .cse28 v_prenex_688) .cse29 v_DerPreprocessor_426) .cse30 v_DerPreprocessor_416))) (let ((.cse24 (store .cse20 .cse23 v_DerPreprocessor_345)) (.cse18 (* v_DerPreprocessor_347 4))) (let ((.cse15 (store .cse24 (+ .cse18 |c_~#queue~0.offset|) v_DerPreprocessor_334)) (.cse16 (+ .cse18 |c_~#queue~0.offset| 4))) (or (not (= (select (store (store (store (store .cse15 .cse16 v_DerPreprocessor_322) .cse2 .cse17) .cse4 (+ 2 v_DerPreprocessor_347)) (+ .cse18 |c_~#queue~0.offset| 8) v_ArrVal_1171) .cse4) 20)) (= (select (store (store (store .cse15 .cse2 .cse19) .cse4 (+ v_DerPreprocessor_347 1)) .cse16 v_ArrVal_1169) .cse4) 20) (not (= (+ (select (store (store (store .cse20 .cse2 .cse21) .cse4 .cse22) .cse23 (select (store (store .cse24 .cse2 .cse25) .cse4 v_DerPreprocessor_347) .cse23)) .cse4) 1) v_DerPreprocessor_347))))))) (forall ((v_prenex_810 Int) (v_prenex_1017 Int) (v_DerPreprocessor_439 Int) (v_prenex_1016 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_487 Int)) (let ((.cse31 (store (store (store .cse12 .cse13 v_DerPreprocessor_487) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1017))) (or (= (select (store (store (store .cse31 .cse2 .cse3) .cse4 .cse32) .cse27 v_prenex_1016) .cse4) 20) (not (= (select (store (store (store (store .cse31 .cse27 v_DerPreprocessor_439) .cse2 .cse33) .cse4 .cse34) .cse28 v_prenex_810) .cse4) 20))))) (forall ((v_prenex_1019 Int) (v_prenex_820 Int) (v_DerPreprocessor_338 Int) (v_prenex_689 Int) (v_DerPreprocessor_418 Int) (v_prenex_597 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_336 Int) (v_DerPreprocessor_502 Int)) (or (< 0 (+ 5 v_DerPreprocessor_338)) (not (= (+ (select (let ((.cse35 (store (store (store (store (store (store (store .cse12 .cse13 v_DerPreprocessor_502) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1019) .cse27 v_prenex_820) .cse28 v_prenex_689) .cse29 v_prenex_597) .cse30 v_DerPreprocessor_418))) (store (store (store .cse35 .cse2 .cse21) .cse4 .cse22) .cse23 (select (store (store (store .cse35 .cse23 v_DerPreprocessor_336) .cse2 .cse25) .cse4 v_DerPreprocessor_338) .cse23))) .cse4) 1) v_DerPreprocessor_338)))) (forall ((v_DerPreprocessor_349 Int) (v_DerPreprocessor_419 Int) (v_prenex_309 Int) (v_prenex_824 Int) (v_prenex_535 Int) (v_ArrVal_1174 Int) (v_prenex_310 Int) (v_DerPreprocessor_351 Int) (v_prenex_1011 Int) (v_prenex_692 Int) (v_prenex_241 Int) (v_DerPreprocessor_464 Int) (v_prenex_591 Int) (v_DerPreprocessor_501 Int)) (let ((.cse36 (store (store (store (store (store (store (store .cse12 .cse13 v_DerPreprocessor_501) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1011) .cse27 v_prenex_824) .cse28 v_prenex_692) .cse29 v_prenex_591) .cse30 v_DerPreprocessor_419))) (let ((.cse37 (store .cse36 .cse23 v_DerPreprocessor_349)) (.cse41 (* v_DerPreprocessor_351 4))) (let ((.cse38 (store (store .cse37 (+ |c_~#queue~0.offset| .cse41) v_prenex_535) (+ |c_~#queue~0.offset| .cse41 4) v_prenex_310)) (.cse39 (+ |c_~#queue~0.offset| 8 .cse41))) (or (not (= v_DerPreprocessor_351 (+ (select (store (store (store .cse36 .cse2 .cse21) .cse4 .cse22) .cse23 (select (store (store .cse37 .cse2 .cse25) .cse4 v_DerPreprocessor_351) .cse23)) .cse4) 1))) (= (select (store (store (store .cse38 .cse2 .cse17) .cse4 (+ 2 v_DerPreprocessor_351)) .cse39 v_prenex_309) .cse4) 20) (not (= 20 (select (store (store (store (store .cse38 .cse39 v_prenex_241) .cse2 .cse40) .cse4 (+ 3 v_DerPreprocessor_351)) (+ |c_~#queue~0.offset| 12 .cse41) v_ArrVal_1174) .cse4)))))))) (forall ((v_prenex_1103 Int) (v_DerPreprocessor_507 Int) (v_DerPreprocessor_470 Int) (v_ArrVal_1144 Int) (v_DerPreprocessor_472 Int)) (let ((.cse44 (store .cse12 .cse13 v_DerPreprocessor_507))) (let ((.cse43 (store (store .cse44 .cse2 .cse7) .cse4 .cse8)) (.cse42 (store (store (store .cse44 .cse9 v_DerPreprocessor_470) .cse2 .cse11) .cse4 v_DerPreprocessor_472))) (or (not (= (select (store .cse42 (+ (* v_DerPreprocessor_472 4) |c_~#queue~0.offset|) v_prenex_1103) .cse4) 20)) (= (select (store .cse43 .cse9 v_ArrVal_1144) .cse4) 20) (not (= v_DerPreprocessor_472 (+ (select (store .cse43 .cse9 (select .cse42 .cse9)) .cse4) 1))))))) (forall ((v_DerPreprocessor_394 Int) (v_prenex_828 Int) (v_prenex_691 Int) (v_DerPreprocessor_396 Int) (v_prenex_593 Int) (v_DerPreprocessor_497 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_420 Int) (v_prenex_527 Int) (v_prenex_528 Int) (v_prenex_1009 Int)) (let ((.cse47 (store (store (store (store (store (store (store .cse12 .cse13 v_DerPreprocessor_497) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1009) .cse27 v_prenex_828) .cse28 v_prenex_691) .cse29 v_prenex_593) .cse30 v_DerPreprocessor_420))) (let ((.cse46 (store (store .cse47 .cse2 .cse21) .cse4 .cse22)) (.cse45 (store (store (store .cse47 .cse23 v_DerPreprocessor_394) .cse2 .cse25) .cse4 v_DerPreprocessor_396))) (or (not (= (select (store .cse45 (+ (* v_DerPreprocessor_396 4) |c_~#queue~0.offset|) v_prenex_528) .cse4) 20)) (= 20 (select (store .cse46 .cse23 v_prenex_527) .cse4)) (not (= (+ (select (store .cse46 .cse23 (select .cse45 .cse23)) .cse4) 1) v_DerPreprocessor_396)))))) (or (forall ((v_DerPreprocessor_405 Int) (v_DerPreprocessor_505 Int) (v_prenex_815 Int) (v_prenex_529 Int) (v_prenex_816 Int) (v_prenex_314 Int) (v_prenex_1007 Int) (v_prenex_598 Int) (v_prenex_312 Int) (v_prenex_1006 Int) (v_prenex_533 Int) (v_prenex_313 Int) (v_prenex_695 Int) (v_prenex_530 Int) (v_prenex_531 Int) (v_prenex_311 Int) (v_ArrVal_1144 Int) (v_prenex_694 Int) (v_ArrVal_1147 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_354 Int) (v_DerPreprocessor_356 Int)) (let ((.cse51 (store .cse12 .cse13 v_DerPreprocessor_505))) (let ((.cse48 (store .cse51 .cse9 v_DerPreprocessor_464))) (let ((.cse55 (store .cse48 .cse26 v_prenex_1007))) (let ((.cse50 (store .cse55 .cse27 v_prenex_816))) (let ((.cse52 (store .cse50 .cse28 v_prenex_695))) (let ((.cse61 (* v_DerPreprocessor_356 4)) (.cse64 (store (store .cse52 .cse29 v_prenex_598) .cse30 v_DerPreprocessor_405))) (let ((.cse65 (store .cse64 .cse23 v_DerPreprocessor_354)) (.cse57 (+ .cse61 |c_~#queue~0.offset|))) (let ((.cse62 (store .cse65 .cse57 v_prenex_533)) (.cse63 (+ .cse61 |c_~#queue~0.offset| 4))) (let ((.cse56 (store (store .cse65 .cse2 .cse25) .cse4 v_DerPreprocessor_356)) (.cse58 (store .cse62 .cse63 v_prenex_313)) (.cse59 (+ .cse61 |c_~#queue~0.offset| 8)) (.cse60 (store (store .cse64 .cse2 .cse21) .cse4 .cse22))) (or (= (select (store (store (store .cse48 .cse2 .cse11) .cse4 .cse49) .cse26 v_ArrVal_1147) .cse4) 20) (= 20 (select (store (store (store .cse50 .cse2 .cse33) .cse4 .cse34) .cse28 v_prenex_815) .cse4)) (= 20 (select (store (store (store .cse51 .cse2 .cse7) .cse4 .cse8) .cse9 v_ArrVal_1144) .cse4)) (= (select (store (store (store .cse52 .cse2 .cse53) .cse4 .cse54) .cse29 v_prenex_694) .cse4) 20) (= (select (store (store (store .cse55 .cse2 .cse3) .cse4 .cse32) .cse27 v_prenex_1006) .cse4) 20) (= (select (store .cse56 .cse57 v_prenex_530) .cse4) 20) (= (select (store (store (store .cse58 .cse2 .cse17) .cse4 (+ 2 v_DerPreprocessor_356)) .cse59 v_prenex_312) .cse4) 20) (not (= (+ (select (store .cse60 .cse23 (select .cse56 .cse23)) .cse4) 1) v_DerPreprocessor_356)) (= 20 (select (store (store (store (store .cse58 .cse59 v_prenex_311) .cse2 .cse40) .cse4 (+ 3 v_DerPreprocessor_356)) (+ .cse61 |c_~#queue~0.offset| 12) v_prenex_314) .cse4)) (= (select (store .cse60 .cse23 v_prenex_529) .cse4) 20) (= (select (store (store (store .cse62 .cse2 .cse19) .cse4 (+ v_DerPreprocessor_356 1)) .cse63 v_prenex_531) .cse4) 20)))))))))))) (< .cse66 21)) (forall ((v_DerPreprocessor_509 Int) (v_ArrVal_1144 Int)) (not (= (select (store (store (store (store .cse12 .cse13 v_DerPreprocessor_509) .cse2 .cse7) .cse4 .cse8) .cse9 v_ArrVal_1144) .cse4) 20))) (not (= .cse14 20)) (forall ((v_DerPreprocessor_415 Int) (v_prenex_826 Int) (v_prenex_518 Int) (v_prenex_519 Int) (v_prenex_307 Int) (v_prenex_825 Int) (v_prenex_308 Int) (v_prenex_305 Int) (v_prenex_306 Int) (v_prenex_697 Int) (v_prenex_698 Int) (v_prenex_1015 Int) (v_prenex_596 Int) (v_DerPreprocessor_371 Int) (v_prenex_520 Int) (v_prenex_1014 Int) (v_ArrVal_1167 Int) (v_DerPreprocessor_483 Int) (v_DerPreprocessor_373 Int) (v_ArrVal_1144 Int) (v_ArrVal_1147 Int) (v_DerPreprocessor_464 Int)) (let ((.cse68 (store .cse12 .cse13 v_DerPreprocessor_483))) (let ((.cse74 (store .cse68 .cse9 v_DerPreprocessor_464))) (let ((.cse77 (store .cse74 .cse26 v_prenex_1015))) (let ((.cse75 (store .cse77 .cse27 v_prenex_826))) (let ((.cse67 (store .cse75 .cse28 v_prenex_698))) (let ((.cse73 (* v_DerPreprocessor_373 4)) (.cse80 (store (store .cse67 .cse29 v_prenex_596) .cse30 v_DerPreprocessor_415))) (let ((.cse81 (store .cse80 .cse23 v_DerPreprocessor_371)) (.cse76 (+ .cse73 |c_~#queue~0.offset|))) (let ((.cse78 (store .cse81 .cse76 v_prenex_520)) (.cse79 (+ .cse73 |c_~#queue~0.offset| 4))) (let ((.cse70 (store (store .cse81 .cse2 .cse25) .cse4 v_DerPreprocessor_373)) (.cse69 (store (store .cse80 .cse2 .cse21) .cse4 .cse22)) (.cse71 (store .cse78 .cse79 v_prenex_307)) (.cse72 (+ .cse73 |c_~#queue~0.offset| 8))) (or (= (select (store (store (store .cse67 .cse2 .cse53) .cse4 .cse54) .cse29 v_prenex_697) .cse4) 20) (= 20 (select (store (store (store .cse68 .cse2 .cse7) .cse4 .cse8) .cse9 v_ArrVal_1144) .cse4)) (not (= (+ (select (store .cse69 .cse23 (select .cse70 .cse23)) .cse4) 1) v_DerPreprocessor_373)) (= (select (store (store (store (store .cse71 .cse72 v_prenex_305) .cse2 .cse40) .cse4 (+ 3 v_DerPreprocessor_373)) (+ .cse73 |c_~#queue~0.offset| 12) v_prenex_308) .cse4) 20) (= (select (store (store (store .cse74 .cse2 .cse11) .cse4 .cse49) .cse26 v_ArrVal_1147) .cse4) 20) (= (select (store (store (store .cse75 .cse2 .cse33) .cse4 .cse34) .cse28 v_prenex_825) .cse4) 20) (= (select (store .cse70 .cse76 v_ArrVal_1167) .cse4) 20) (< v_DerPreprocessor_373 17) (= (select (store (store (store .cse77 .cse2 .cse3) .cse4 .cse32) .cse27 v_prenex_1014) .cse4) 20) (= 20 (select (store .cse69 .cse23 v_prenex_518) .cse4)) (= (select (store (store (store .cse78 .cse2 .cse19) .cse4 (+ v_DerPreprocessor_373 1)) .cse79 v_prenex_519) .cse4) 20) (= 20 (select (store (store (store .cse71 .cse2 .cse17) .cse4 (+ 2 v_DerPreprocessor_373)) .cse72 v_prenex_306) .cse4))))))))))))) (forall ((v_prenex_521 Int) (v_prenex_1005 Int) (v_DerPreprocessor_391 Int) (v_prenex_522 Int) (v_DerPreprocessor_491 Int) (v_prenex_592 Int) (v_DerPreprocessor_331 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_431 Int) (v_DerPreprocessor_421 Int) (v_DerPreprocessor_389 Int) (v_DerPreprocessor_436 Int)) (let ((.cse82 (store (store (store (store (store (store (store .cse12 .cse13 v_DerPreprocessor_491) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1005) .cse27 v_DerPreprocessor_436) .cse28 v_DerPreprocessor_431) .cse29 v_prenex_592) .cse30 v_DerPreprocessor_421))) (let ((.cse86 (* v_DerPreprocessor_391 4)) (.cse85 (store .cse82 .cse23 v_DerPreprocessor_389))) (let ((.cse83 (store (store .cse85 .cse2 .cse25) .cse4 v_DerPreprocessor_391)) (.cse84 (+ |c_~#queue~0.offset| .cse86))) (or (not (= v_DerPreprocessor_391 (+ (select (store (store (store .cse82 .cse2 .cse21) .cse4 .cse22) .cse23 (select .cse83 .cse23)) .cse4) 1))) (= (select (store .cse83 .cse84 v_prenex_521) .cse4) 20) (not (= 20 (select (store (store (store (store .cse85 .cse84 v_DerPreprocessor_331) .cse2 .cse19) .cse4 (+ v_DerPreprocessor_391 1)) (+ |c_~#queue~0.offset| 4 .cse86) v_prenex_522) .cse4)))))))) (not (= 14 .cse14)) (or (< 0 (+ .cse66 1)) (forall ((v_DerPreprocessor_317 Int) (v_prenex_817 Int) (v_prenex_818 Int) (v_prenex_525 Int) (v_prenex_228 Int) (v_prenex_526 Int) (v_prenex_523 Int) (v_prenex_524 Int) (v_prenex_304 Int) (v_DerPreprocessor_490 Int) (v_DerPreprocessor_380 Int) (v_prenex_599 Int) (v_prenex_1013 Int) (v_prenex_595 Int) (v_prenex_1012 Int) (v_ArrVal_1144 Int) (v_ArrVal_1147 Int) (v_DerPreprocessor_464 Int) (v_prenex_690 Int) (v_DerPreprocessor_400 Int) (v_DerPreprocessor_378 Int) (v_DerPreprocessor_325 Int)) (let ((.cse89 (store .cse12 .cse13 v_DerPreprocessor_490))) (let ((.cse96 (store .cse89 .cse9 v_DerPreprocessor_464))) (let ((.cse99 (store .cse96 .cse26 v_prenex_1013))) (let ((.cse98 (store .cse99 .cse27 v_prenex_818))) (let ((.cse97 (store .cse98 .cse28 v_prenex_690))) (let ((.cse90 (* v_DerPreprocessor_380 4)) (.cse100 (store (store .cse97 .cse29 v_prenex_595) .cse30 v_DerPreprocessor_400))) (let ((.cse101 (store .cse100 .cse23 v_DerPreprocessor_378)) (.cse95 (+ .cse90 |c_~#queue~0.offset|))) (let ((.cse93 (store .cse101 .cse95 v_prenex_526)) (.cse94 (+ .cse90 |c_~#queue~0.offset| 4))) (let ((.cse87 (store .cse93 .cse94 v_DerPreprocessor_325)) (.cse88 (+ .cse90 |c_~#queue~0.offset| 8)) (.cse92 (store (store .cse101 .cse2 .cse25) .cse4 v_DerPreprocessor_380)) (.cse91 (store (store .cse100 .cse2 .cse21) .cse4 .cse22))) (or (= 20 (select (store (store (store .cse87 .cse2 .cse17) .cse4 (+ 2 v_DerPreprocessor_380)) .cse88 v_prenex_304) .cse4)) (= (select (store (store (store .cse89 .cse2 .cse7) .cse4 .cse8) .cse9 v_ArrVal_1144) .cse4) 20) (= (select (store (store (store (store .cse87 .cse88 v_DerPreprocessor_317) .cse2 .cse40) .cse4 (+ 3 v_DerPreprocessor_380)) (+ .cse90 |c_~#queue~0.offset| 12) v_prenex_228) .cse4) 20) (not (= (+ (select (store .cse91 .cse23 (select .cse92 .cse23)) .cse4) 1) v_DerPreprocessor_380)) (= (select (store (store (store .cse93 .cse2 .cse19) .cse4 (+ v_DerPreprocessor_380 1)) .cse94 v_prenex_525) .cse4) 20) (= (select (store .cse92 .cse95 v_prenex_524) .cse4) 20) (= (select (store (store (store .cse96 .cse2 .cse11) .cse4 .cse49) .cse26 v_ArrVal_1147) .cse4) 20) (= (select (store .cse91 .cse23 v_prenex_523) .cse4) 20) (= 20 (select (store (store (store .cse97 .cse2 .cse53) .cse4 .cse54) .cse29 v_prenex_599) .cse4)) (= (select (store (store (store .cse98 .cse2 .cse33) .cse4 .cse34) .cse28 v_prenex_817) .cse4) 20) (= (select (store (store (store .cse99 .cse2 .cse3) .cse4 .cse32) .cse27 v_prenex_1012) .cse4) 20))))))))))))) (forall ((v_ArrVal_1163 Int) (v_prenex_1003 Int) (v_prenex_696 Int) (v_prenex_594 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_498 Int) (v_DerPreprocessor_423 Int) (v_prenex_812 Int)) (not (= (select (store (store (store (store (store (store (store (store (store (store .cse12 .cse13 v_DerPreprocessor_498) .cse9 v_DerPreprocessor_464) .cse26 v_prenex_1003) .cse27 v_prenex_812) .cse28 v_prenex_696) .cse29 v_prenex_594) .cse30 v_DerPreprocessor_423) .cse2 .cse21) .cse4 .cse22) .cse23 v_ArrVal_1163) .cse4) 20))) (not (= 21 .cse14)) (forall ((v_prenex_821 Int) (v_prenex_693 Int) (v_DerPreprocessor_495 Int) (v_ArrVal_1158 Int) (v_DerPreprocessor_464 Int) (v_DerPreprocessor_444 Int) (v_prenex_822 Int)) (let ((.cse102 (store (store (store (store .cse12 .cse13 v_DerPreprocessor_495) .cse9 v_DerPreprocessor_464) .cse26 v_DerPreprocessor_444) .cse27 v_prenex_822))) (or (not (= (select (store (store (store (store .cse102 .cse28 v_prenex_693) .cse2 .cse53) .cse4 .cse54) .cse29 v_ArrVal_1158) .cse4) 20)) (= (select (store (store (store .cse102 .cse2 .cse33) .cse4 .cse34) .cse28 v_prenex_821) .cse4) 20))))))))) is different from false [2024-06-27 17:55:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2024-06-27 17:55:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418543088] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:55:08,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:55:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 40 [2024-06-27 17:55:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513294221] [2024-06-27 17:55:08,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:55:08,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-06-27 17:55:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:55:08,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-06-27 17:55:08,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1012, Unknown=24, NotChecked=370, Total=1722 [2024-06-27 17:55:08,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:55:08,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 427 flow. Second operand has 42 states, 42 states have (on average 10.5) internal successors, (441), 42 states have internal predecessors, (441), 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-27 17:55:08,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:55:08,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:55:08,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:56:40,778 INFO L124 PetriNetUnfolderBase]: 4770/8898 cut-off events. [2024-06-27 17:56:40,778 INFO L125 PetriNetUnfolderBase]: For 38320/38328 co-relation queries the response was YES. [2024-06-27 17:56:40,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28627 conditions, 8898 events. 4770/8898 cut-off events. For 38320/38328 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 60031 event pairs, 914 based on Foata normal form. 360/9096 useless extension candidates. Maximal degree in co-relation 28604. Up to 5895 conditions per place. [2024-06-27 17:56:40,815 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 474 selfloop transitions, 60 changer transitions 67/607 dead transitions. [2024-06-27 17:56:40,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 607 transitions, 4208 flow [2024-06-27 17:56:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-27 17:56:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-27 17:56:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 903 transitions. [2024-06-27 17:56:40,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6003989361702128 [2024-06-27 17:56:40,819 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 427 flow. Second operand 32 states and 903 transitions. [2024-06-27 17:56:40,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 607 transitions, 4208 flow [2024-06-27 17:56:40,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 607 transitions, 4138 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:56:40,843 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 1227 flow [2024-06-27 17:56:40,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1227, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2024-06-27 17:56:40,844 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places. [2024-06-27 17:56:40,844 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 1227 flow [2024-06-27 17:56:40,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 10.5) internal successors, (441), 42 states have internal predecessors, (441), 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-27 17:56:40,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:56:40,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:56:40,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-27 17:56:41,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:56:41,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:56:41,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:56:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -48263671, now seen corresponding path program 1 times [2024-06-27 17:56:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:56:41,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993826839] [2024-06-27 17:56:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:56:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:56:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:56:41,113 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-27 17:56:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:56:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993826839] [2024-06-27 17:56:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993826839] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:56:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642897141] [2024-06-27 17:56:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:56:41,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:56:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:56:41,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:56:41,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 17:56:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:56:41,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:56:41,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:56:41,333 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-27 17:56:41,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:56:41,346 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-27 17:56:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642897141] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:56:41,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:56:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-06-27 17:56:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104947406] [2024-06-27 17:56:41,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:56:41,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:56:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:56:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:56:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:56:41,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:56:41,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 1227 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-27 17:56:41,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:56:41,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:56:41,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:56:42,331 INFO L124 PetriNetUnfolderBase]: 4255/7951 cut-off events. [2024-06-27 17:56:42,332 INFO L125 PetriNetUnfolderBase]: For 31241/31245 co-relation queries the response was YES. [2024-06-27 17:56:42,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33006 conditions, 7951 events. 4255/7951 cut-off events. For 31241/31245 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 53733 event pairs, 3037 based on Foata normal form. 48/7851 useless extension candidates. Maximal degree in co-relation 32966. Up to 7455 conditions per place. [2024-06-27 17:56:42,418 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 134 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2024-06-27 17:56:42,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 1741 flow [2024-06-27 17:56:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:56:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:56:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 17:56:42,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2024-06-27 17:56:42,421 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 1227 flow. Second operand 6 states and 126 transitions. [2024-06-27 17:56:42,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 1741 flow [2024-06-27 17:56:42,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 145 transitions, 1301 flow, removed 200 selfloop flow, removed 15 redundant places. [2024-06-27 17:56:42,479 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 781 flow [2024-06-27 17:56:42,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=781, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-06-27 17:56:42,480 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-27 17:56:42,480 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 781 flow [2024-06-27 17:56:42,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-27 17:56:42,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:56:42,481 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:56:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:56:42,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 17:56:42,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:56:42,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:56:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2074108362, now seen corresponding path program 2 times [2024-06-27 17:56:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:56:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879536414] [2024-06-27 17:56:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:56:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:56:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:56:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:56:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:56:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879536414] [2024-06-27 17:56:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879536414] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:56:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021307476] [2024-06-27 17:56:42,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:56:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:56:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:56:42,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:56:42,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-27 17:56:42,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:56:42,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:56:42,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:56:43,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:56:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:56:43,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:56:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:56:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021307476] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:56:43,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:56:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-06-27 17:56:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538659366] [2024-06-27 17:56:43,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:56:43,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:56:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:56:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:56:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:56:43,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:56:43,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 781 flow. Second operand has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 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-27 17:56:43,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:56:43,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:56:43,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:56:43,928 INFO L124 PetriNetUnfolderBase]: 2832/5304 cut-off events. [2024-06-27 17:56:43,928 INFO L125 PetriNetUnfolderBase]: For 26973/26977 co-relation queries the response was YES. [2024-06-27 17:56:43,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21561 conditions, 5304 events. 2832/5304 cut-off events. For 26973/26977 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 33272 event pairs, 1758 based on Foata normal form. 124/5327 useless extension candidates. Maximal degree in co-relation 21520. Up to 4670 conditions per place. [2024-06-27 17:56:43,953 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 164 selfloop transitions, 13 changer transitions 0/183 dead transitions. [2024-06-27 17:56:43,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 183 transitions, 1729 flow [2024-06-27 17:56:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:56:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:56:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-27 17:56:43,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42021276595744683 [2024-06-27 17:56:43,957 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 781 flow. Second operand 12 states and 237 transitions. [2024-06-27 17:56:43,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 183 transitions, 1729 flow [2024-06-27 17:56:43,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 1705 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 17:56:43,995 INFO L231 Difference]: Finished difference. Result has 123 places, 104 transitions, 753 flow [2024-06-27 17:56:43,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=753, PETRI_PLACES=123, PETRI_TRANSITIONS=104} [2024-06-27 17:56:43,995 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2024-06-27 17:56:43,995 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 104 transitions, 753 flow [2024-06-27 17:56:43,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 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-27 17:56:43,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:56:43,996 INFO L208 CegarLoopForPetriNet]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:56:44,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 17:56:44,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:56:44,208 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 17:56:44,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:56:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -197585123, now seen corresponding path program 5 times [2024-06-27 17:56:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:56:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818655242] [2024-06-27 17:56:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:56:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:56:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:56:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:56:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:56:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818655242] [2024-06-27 17:56:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818655242] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:56:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404149094] [2024-06-27 17:56:50,406 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:56:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:56:50,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:56:50,407 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:56:50,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Killed by 15