./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/protection/circular_buffer_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb4cb34f 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-deagle/circular_buffer_ok.i ./goblint.2024-06-19_11-23-25.files/protection/circular_buffer_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-eb4cb34-m [2024-06-21 16:06:54,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-21 16:06:54,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-21 16:06:54,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-21 16:06:54,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-21 16:06:54,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-21 16:06:54,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-21 16:06:54,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-21 16:06:54,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-21 16:06:54,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-21 16:06:54,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-21 16:06:54,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-21 16:06:54,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-21 16:06:54,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-21 16:06:54,708 INFO L153 SettingsManager]: * Use SBE=true [2024-06-21 16:06:54,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-21 16:06:54,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-21 16:06:54,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-21 16:06:54,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-21 16:06:54,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-21 16:06:54,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-21 16:06:54,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-21 16:06:54,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-21 16:06:54,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-21 16:06:54,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-21 16:06:54,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-21 16:06:54,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-21 16:06:54,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-21 16:06:54,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-21 16:06:54,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-21 16:06:54,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-21 16:06:54,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-21 16:06:54,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 16:06:54,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-21 16:06:54,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-21 16:06:54,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-21 16:06:54,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-21 16:06:54,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-21 16:06:54,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-21 16:06:54,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-21 16:06:54,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-21 16:06:54,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-21 16:06:54,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-21 16:06:54,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-21 16:06:54,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-21 16:06:54,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-21 16:06:54,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-21 16:06:54,915 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-21 16:06:54,915 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-21 16:06:54,916 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/circular_buffer_ok.yml/witness.yml [2024-06-21 16:06:55,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-21 16:06:55,019 INFO L274 PluginConnector]: CDTParser initialized [2024-06-21 16:06:55,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-21 16:06:56,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-21 16:06:56,270 INFO L384 CDTParser]: Found 1 translation units. [2024-06-21 16:06:56,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-21 16:06:56,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f11dd92/bdfd4c21c8f04f998eb44eec5cab056f/FLAG9a918b364 [2024-06-21 16:06:56,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f11dd92/bdfd4c21c8f04f998eb44eec5cab056f [2024-06-21 16:06:56,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-21 16:06:56,302 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-21 16:06:56,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-21 16:06:56,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-21 16:06:56,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-21 16:06:56,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 04:06:55" (1/2) ... [2024-06-21 16:06:56,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3234c085 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 04:06:56, skipping insertion in model container [2024-06-21 16:06:56,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 04:06:55" (1/2) ... [2024-06-21 16:06:56,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34d5eaf2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 04:06:56, skipping insertion in model container [2024-06-21 16:06:56,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 04:06:56" (2/2) ... [2024-06-21 16:06:56,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3234c085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56, skipping insertion in model container [2024-06-21 16:06:56,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 04:06:56" (2/2) ... [2024-06-21 16:06:56,313 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-21 16:06:56,339 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-21 16:06:56,340 INFO L97 edCorrectnessWitness]: Location invariant before [L765-L765] ! multithreaded || (0 <= value && value <= 6) [2024-06-21 16:06:56,344 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] ! multithreaded || (0 <= value && value <= 6) [2024-06-21 16:06:56,344 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-21 16:06:56,344 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-21 16:06:56,344 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-06-21 16:06:56,344 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-06-21 16:06:56,344 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-06-21 16:06:56,344 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-06-21 16:06:56,344 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-06-21 16:06:56,379 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-21 16:06:56,663 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 16:06:56,673 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-21 16:06:56,770 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 16:06:56,808 INFO L206 MainTranslator]: Completed translation [2024-06-21 16:06:56,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56 WrapperNode [2024-06-21 16:06:56,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-21 16:06:56,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-21 16:06:56,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-21 16:06:56,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-21 16:06:56,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,867 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-06-21 16:06:56,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-21 16:06:56,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-21 16:06:56,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-21 16:06:56,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-21 16:06:56,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,918 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-06-21 16:06:56,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-21 16:06:56,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-21 16:06:56,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-21 16:06:56,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-21 16:06:56,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (1/1) ... [2024-06-21 16:06:56,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 16:06:56,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:06:56,982 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-21 16:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-21 16:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-21 16:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-21 16:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-21 16:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-21 16:06:57,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-21 16:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-21 16:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-21 16:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-21 16:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-21 16:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-21 16:06:56,998 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-21 16:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-21 16:06:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-21 16:06:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-21 16:06:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-21 16:06:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-21 16:06:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-21 16:06:57,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-21 16:06:57,016 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-21 16:06:57,139 INFO L244 CfgBuilder]: Building ICFG [2024-06-21 16:06:57,141 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-21 16:06:57,383 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-21 16:06:57,384 INFO L293 CfgBuilder]: Performing block encoding [2024-06-21 16:06:57,565 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-21 16:06:57,565 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-21 16:06:57,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 04:06:57 BoogieIcfgContainer [2024-06-21 16:06:57,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-21 16:06:57,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-21 16:06:57,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-21 16:06:57,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-21 16:06:57,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 04:06:55" (1/4) ... [2024-06-21 16:06:57,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586f6223 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 04:06:57, skipping insertion in model container [2024-06-21 16:06:57,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 04:06:56" (2/4) ... [2024-06-21 16:06:57,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586f6223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 04:06:57, skipping insertion in model container [2024-06-21 16:06:57,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 04:06:56" (3/4) ... [2024-06-21 16:06:57,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586f6223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 04:06:57, skipping insertion in model container [2024-06-21 16:06:57,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 04:06:57" (4/4) ... [2024-06-21 16:06:57,579 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-06-21 16:06:57,592 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-21 16:06:57,593 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-21 16:06:57,593 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-21 16:06:57,630 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-21 16:06:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 72 flow [2024-06-21 16:06:57,681 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2024-06-21 16:06:57,681 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-21 16:06:57,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-21 16:06:57,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 72 flow [2024-06-21 16:06:57,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 59 flow [2024-06-21 16:06:57,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-21 16:06:57,709 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;@7e8a5e32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-21 16:06:57,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-21 16:06:57,712 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-21 16:06:57,712 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-21 16:06:57,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 16:06:57,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:06:57,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-21 16:06:57,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:06:57,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:06:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash 406286641, now seen corresponding path program 1 times [2024-06-21 16:06:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:06:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302037475] [2024-06-21 16:06:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:06:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:06:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 16:06:58,030 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-21 16:06:58,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:06:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302037475] [2024-06-21 16:06:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302037475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 16:06:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 16:06:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-21 16:06:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723004539] [2024-06-21 16:06:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 16:06:58,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-21 16:06:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:06:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-21 16:06:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-21 16:06:58,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-21 16:06:58,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-21 16:06:58,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:06:58,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-21 16:06:58,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:06:58,252 INFO L124 PetriNetUnfolderBase]: 267/484 cut-off events. [2024-06-21 16:06:58,253 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-21 16:06:58,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 484 events. 267/484 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2009 event pairs, 95 based on Foata normal form. 24/497 useless extension candidates. Maximal degree in co-relation 899. Up to 308 conditions per place. [2024-06-21 16:06:58,257 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 2 changer transitions 3/39 dead transitions. [2024-06-21 16:06:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-06-21 16:06:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-21 16:06:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-21 16:06:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-21 16:06:58,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2024-06-21 16:06:58,268 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 59 flow. Second operand 3 states and 55 transitions. [2024-06-21 16:06:58,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-06-21 16:06:58,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-21 16:06:58,273 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 65 flow [2024-06-21 16:06:58,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-06-21 16:06:58,277 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2024-06-21 16:06:58,277 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 65 flow [2024-06-21 16:06:58,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-21 16:06:58,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:06:58,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:06:58,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-21 16:06:58,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:06:58,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:06:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2116370505, now seen corresponding path program 1 times [2024-06-21 16:06:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:06:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974356561] [2024-06-21 16:06:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:06:58,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:06:58,312 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:06:58,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175796782] [2024-06-21 16:06:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:06:58,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:06:58,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:06:58,318 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-21 16:06:58,337 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-21 16:06:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 16:06:58,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-21 16:06:58,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:06:58,571 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-21 16:06:58,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-21 16:06:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:06:58,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974356561] [2024-06-21 16:06:58,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:06:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175796782] [2024-06-21 16:06:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175796782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 16:06:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 16:06:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-21 16:06:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333093455] [2024-06-21 16:06:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 16:06:58,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-21 16:06:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:06:58,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-21 16:06:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-21 16:06:58,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-21 16:06:58,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-21 16:06:58,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:06:58,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-21 16:06:58,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:06:58,699 INFO L124 PetriNetUnfolderBase]: 339/610 cut-off events. [2024-06-21 16:06:58,699 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-21 16:06:58,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 610 events. 339/610 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2444 event pairs, 98 based on Foata normal form. 50/656 useless extension candidates. Maximal degree in co-relation 703. Up to 296 conditions per place. [2024-06-21 16:06:58,703 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 42 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2024-06-21 16:06:58,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 51 transitions, 217 flow [2024-06-21 16:06:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-21 16:06:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-21 16:06:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-06-21 16:06:58,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2024-06-21 16:06:58,705 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 65 flow. Second operand 4 states and 76 transitions. [2024-06-21 16:06:58,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 51 transitions, 217 flow [2024-06-21 16:06:58,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 51 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 16:06:58,706 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 97 flow [2024-06-21 16:06:58,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-21 16:06:58,707 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2024-06-21 16:06:58,707 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 97 flow [2024-06-21 16:06:58,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-21 16:06:58,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:06:58,708 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:06:58,723 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-21 16:06:58,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:06:58,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:06:58,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:06:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 811367141, now seen corresponding path program 1 times [2024-06-21 16:06:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:06:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719482267] [2024-06-21 16:06:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:06:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:06:58,937 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:06:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910387875] [2024-06-21 16:06:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:06:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:06:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:06:58,938 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-21 16:06:58,956 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-21 16:06:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 16:06:59,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-21 16:06:59,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:06:59,100 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-21 16:06:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:06:59,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-21 16:07:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:07:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:07:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719482267] [2024-06-21 16:07:00,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:07:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910387875] [2024-06-21 16:07:00,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910387875] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-21 16:07:00,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-21 16:07:00,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-06-21 16:07:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583055479] [2024-06-21 16:07:00,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-21 16:07:00,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-21 16:07:00,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:07:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-21 16:07:00,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-06-21 16:07:00,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-21 16:07:00,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 97 flow. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-21 16:07:00,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:07:00,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-21 16:07:00,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:07:00,661 INFO L124 PetriNetUnfolderBase]: 945/1723 cut-off events. [2024-06-21 16:07:00,661 INFO L125 PetriNetUnfolderBase]: For 1354/1354 co-relation queries the response was YES. [2024-06-21 16:07:00,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 1723 events. 945/1723 cut-off events. For 1354/1354 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8226 event pairs, 68 based on Foata normal form. 199/1921 useless extension candidates. Maximal degree in co-relation 3663. Up to 279 conditions per place. [2024-06-21 16:07:00,668 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 121 selfloop transitions, 26 changer transitions 20/171 dead transitions. [2024-06-21 16:07:00,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 171 transitions, 791 flow [2024-06-21 16:07:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-21 16:07:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-21 16:07:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 272 transitions. [2024-06-21 16:07:00,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6252873563218391 [2024-06-21 16:07:00,674 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 97 flow. Second operand 15 states and 272 transitions. [2024-06-21 16:07:00,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 171 transitions, 791 flow [2024-06-21 16:07:00,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 171 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 16:07:00,678 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 337 flow [2024-06-21 16:07:00,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=337, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-06-21 16:07:00,679 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-21 16:07:00,680 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 337 flow [2024-06-21 16:07:00,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-21 16:07:00,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:07:00,680 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:07:00,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-21 16:07:00,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-21 16:07:00,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:07:00,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:07:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash -919733271, now seen corresponding path program 1 times [2024-06-21 16:07:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:07:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406182644] [2024-06-21 16:07:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:07:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:07:00,930 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:07:00,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387807514] [2024-06-21 16:07:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:07:00,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:07:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:07:00,932 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-21 16:07:00,952 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-21 16:07:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 16:07:01,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-21 16:07:01,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:07:01,055 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-21 16:07:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-21 16:07:01,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-21 16:07:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:07:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406182644] [2024-06-21 16:07:01,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:07:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387807514] [2024-06-21 16:07:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387807514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 16:07:01,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 16:07:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 16:07:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862717381] [2024-06-21 16:07:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 16:07:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-21 16:07:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:07:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-21 16:07:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-21 16:07:01,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-21 16:07:01,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-21 16:07:01,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:07:01,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-21 16:07:01,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:07:01,188 INFO L124 PetriNetUnfolderBase]: 589/1156 cut-off events. [2024-06-21 16:07:01,189 INFO L125 PetriNetUnfolderBase]: For 2254/2277 co-relation queries the response was YES. [2024-06-21 16:07:01,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1156 events. 589/1156 cut-off events. For 2254/2277 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5223 event pairs, 195 based on Foata normal form. 73/1216 useless extension candidates. Maximal degree in co-relation 3227. Up to 563 conditions per place. [2024-06-21 16:07:01,196 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 64 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-06-21 16:07:01,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 588 flow [2024-06-21 16:07:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-21 16:07:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-21 16:07:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-21 16:07:01,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2024-06-21 16:07:01,202 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 337 flow. Second operand 3 states and 54 transitions. [2024-06-21 16:07:01,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 588 flow [2024-06-21 16:07:01,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 538 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-21 16:07:01,215 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 308 flow [2024-06-21 16:07:01,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2024-06-21 16:07:01,216 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-21 16:07:01,216 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 308 flow [2024-06-21 16:07:01,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-21 16:07:01,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:07:01,217 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:07:01,232 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-21 16:07:01,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:07:01,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:07:01,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:07:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 421639694, now seen corresponding path program 1 times [2024-06-21 16:07:01,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:07:01,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889525103] [2024-06-21 16:07:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:07:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:07:01,452 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:07:01,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657613581] [2024-06-21 16:07:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:07:01,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:07:01,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:07:01,465 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-21 16:07:01,484 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-21 16:07:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 16:07:01,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-21 16:07:01,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:07:01,642 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-21 16:07:01,645 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-21 16:07:01,649 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-21 16:07:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:07:03,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-21 16:07:05,197 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-21 16:07:07,050 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-21 16:07:09,367 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 9 treesize of output 1 [2024-06-21 16:07:09,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-21 16:07:09,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 121 treesize of output 122 [2024-06-21 16:07:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:07:09,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:07:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889525103] [2024-06-21 16:07:09,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:07:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657613581] [2024-06-21 16:07:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657613581] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-21 16:07:09,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-21 16:07:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 19 [2024-06-21 16:07:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512516351] [2024-06-21 16:07:09,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-21 16:07:09,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-21 16:07:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:07:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-21 16:07:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-06-21 16:07:10,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-21 16:07:10,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 308 flow. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 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-21 16:07:10,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:07:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-21 16:07:10,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:07:21,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:07:37,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:08:03,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:08:18,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:08:23,767 INFO L124 PetriNetUnfolderBase]: 5048/8691 cut-off events. [2024-06-21 16:08:23,767 INFO L125 PetriNetUnfolderBase]: For 31731/31731 co-relation queries the response was YES. [2024-06-21 16:08:23,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26344 conditions, 8691 events. 5048/8691 cut-off events. For 31731/31731 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 52096 event pairs, 371 based on Foata normal form. 191/8879 useless extension candidates. Maximal degree in co-relation 23081. Up to 1034 conditions per place. [2024-06-21 16:08:23,799 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 427 selfloop transitions, 140 changer transitions 127/695 dead transitions. [2024-06-21 16:08:23,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 695 transitions, 4387 flow [2024-06-21 16:08:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-06-21 16:08:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2024-06-21 16:08:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 810 transitions. [2024-06-21 16:08:23,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4433497536945813 [2024-06-21 16:08:23,804 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 308 flow. Second operand 63 states and 810 transitions. [2024-06-21 16:08:23,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 695 transitions, 4387 flow [2024-06-21 16:08:23,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 695 transitions, 4226 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 16:08:23,846 INFO L231 Difference]: Finished difference. Result has 142 places, 183 transitions, 1890 flow [2024-06-21 16:08:23,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1890, PETRI_PLACES=142, PETRI_TRANSITIONS=183} [2024-06-21 16:08:23,846 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-21 16:08:23,847 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 1890 flow [2024-06-21 16:08:23,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 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-21 16:08:23,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:08:23,847 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:08:23,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-21 16:08:24,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:08:24,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:08:24,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:08:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1338660735, now seen corresponding path program 1 times [2024-06-21 16:08:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:08:24,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185062589] [2024-06-21 16:08:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:08:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:08:24,072 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:08:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363463894] [2024-06-21 16:08:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:08:24,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:08:24,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:08:24,073 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-21 16:08:24,074 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-21 16:08:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 16:08:24,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-21 16:08:24,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:08:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-21 16:08:24,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-21 16:08:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-21 16:08:25,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:08:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185062589] [2024-06-21 16:08:25,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:08:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363463894] [2024-06-21 16:08:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363463894] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-21 16:08:25,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-21 16:08:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2024-06-21 16:08:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527192458] [2024-06-21 16:08:25,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-21 16:08:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-21 16:08:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:08:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-21 16:08:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-06-21 16:08:25,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-21 16:08:25,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 1890 flow. Second operand has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 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-21 16:08:25,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:08:25,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-21 16:08:25,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:08:27,413 INFO L124 PetriNetUnfolderBase]: 3284/6546 cut-off events. [2024-06-21 16:08:27,414 INFO L125 PetriNetUnfolderBase]: For 59217/59217 co-relation queries the response was YES. [2024-06-21 16:08:27,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24093 conditions, 6546 events. 3284/6546 cut-off events. For 59217/59217 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 45401 event pairs, 475 based on Foata normal form. 198/6742 useless extension candidates. Maximal degree in co-relation 23565. Up to 1751 conditions per place. [2024-06-21 16:08:27,450 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 265 selfloop transitions, 85 changer transitions 44/397 dead transitions. [2024-06-21 16:08:27,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 397 transitions, 4173 flow [2024-06-21 16:08:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-21 16:08:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-21 16:08:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 277 transitions. [2024-06-21 16:08:27,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5969827586206896 [2024-06-21 16:08:27,451 INFO L175 Difference]: Start difference. First operand has 142 places, 183 transitions, 1890 flow. Second operand 16 states and 277 transitions. [2024-06-21 16:08:27,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 397 transitions, 4173 flow [2024-06-21 16:08:27,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 397 transitions, 3375 flow, removed 370 selfloop flow, removed 19 redundant places. [2024-06-21 16:08:27,638 INFO L231 Difference]: Finished difference. Result has 131 places, 207 transitions, 1853 flow [2024-06-21 16:08:27,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1853, PETRI_PLACES=131, PETRI_TRANSITIONS=207} [2024-06-21 16:08:27,639 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-21 16:08:27,639 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 207 transitions, 1853 flow [2024-06-21 16:08:27,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 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-21 16:08:27,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:08:27,640 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:08:27,653 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-21 16:08:27,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:08:27,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:08:27,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:08:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1268089988, now seen corresponding path program 2 times [2024-06-21 16:08:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:08:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905916392] [2024-06-21 16:08:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:08:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:08:27,867 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:08:27,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082164524] [2024-06-21 16:08:27,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-21 16:08:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:08:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:08:27,870 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-21 16:08:27,888 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-21 16:08:28,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-21 16:08:28,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-21 16:08:28,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 24 conjunts are in the unsatisfiable core [2024-06-21 16:08:28,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:08:28,105 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-21 16:08:28,108 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-21 16:08:28,111 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-21 16:08:29,590 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-21 16:08:29,595 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-21 16:08:29,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2024-06-21 16:08:29,605 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 3 [2024-06-21 16:08:29,618 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 3 [2024-06-21 16:08:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:08:30,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-21 16:08:32,161 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 4 [2024-06-21 16:08:32,171 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-21 16:08:33,436 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 4 [2024-06-21 16:08:33,446 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-21 16:08:35,044 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 4 [2024-06-21 16:08:35,107 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-21 16:08:36,899 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 9 treesize of output 1 [2024-06-21 16:08:36,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-06-21 16:08:36,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 treesize of output 4 [2024-06-21 16:08:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:08:37,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:08:37,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905916392] [2024-06-21 16:08:37,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:08:37,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082164524] [2024-06-21 16:08:37,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082164524] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-21 16:08:37,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-21 16:08:37,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 27 [2024-06-21 16:08:37,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918597620] [2024-06-21 16:08:37,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-21 16:08:37,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-06-21 16:08:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:08:37,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-06-21 16:08:37,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2024-06-21 16:08:38,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-21 16:08:38,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 207 transitions, 1853 flow. Second operand has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 29 states have internal predecessors, (225), 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-21 16:08:38,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:08:38,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-21 16:08:38,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:08:43,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:09:03,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:09:09,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:09:12,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse2 (< .cse22 (+ .cse24 1))) (.cse5 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse8 (= (mod c_~receive~0 256) 0)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse9 (or .cse2 .cse5)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse10)) (.cse15 (and .cse9 (not (= .cse25 0)))) (.cse16 (< 0 .cse25)) (.cse18 (< 0 .cse20)) (.cse19 (< .cse17 0)) (.cse13 (not .cse8)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse6 (not .cse3)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse22 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse22 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse24 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (or .cse1 .cse7 .cse8 (and .cse9 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse13 (and (or .cse15 .cse3 .cse4 .cse16) (or .cse6 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse0 (= .cse17 0) .cse2 .cse3 .cse18 .cse19 .cse5) (or .cse15 .cse7 .cse8 .cse4 .cse11 .cse12 .cse16) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse14) (or (and (or .cse7 .cse8 .cse11 .cse12 (and (not (= .cse20 0)) .cse9) .cse18 .cse19) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse6) (let ((.cse21 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse21) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse7 .cse8 (and (not (= .cse21 0)) .cse9) .cse6 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse4 .cse5))))))))) is different from false [2024-06-21 16:09:12,394 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse26 (mod c_~next~0 4294967296))) (let ((.cse2 (< .cse24 (+ .cse26 1))) (.cse5 (< c_~buffer_size~0 1))) (let ((.cse10 (or .cse2 .cse5)) (.cse27 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse3 (= (mod c_~send~0 256) 0))) (let ((.cse9 (= (mod c_~receive~0 256) 0)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse22 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (not .cse3)) (.cse15 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse20 (and .cse10 (not (= .cse27 0)))) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse27)) (.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse11)) (.cse6 (or .cse20 .cse3 .cse4 .cse21)) (.cse16 (or .cse7 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15)) (.cse18 (< 0 .cse22)) (.cse19 (< .cse17 0)) (.cse14 (not .cse9)) (.cse8 (< (+ c_~value~0 2147483648) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse13 (and (or (let ((.cse25 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse24 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse24 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse26 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (or .cse7 (and (or .cse1 .cse8 .cse9 (and .cse10 (not (= .cse11 0))) .cse12 .cse13 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse14 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15))) (or .cse14 (and .cse6 .cse16)) (or .cse0 (= .cse17 0) .cse2 .cse3 .cse18 .cse19 .cse5) .cse16 (or .cse20 .cse8 .cse9 .cse4 .cse12 .cse13 .cse21) (or .cse14 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7 .cse15) (or (and (or .cse8 .cse9 .cse12 .cse13 (and (not (= .cse22 0)) .cse10) .cse18 .cse19) (or .cse14 .cse15 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse7) (let ((.cse23 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse23) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse8 .cse9 (and (not (= .cse23 0)) .cse10) .cse7 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5)))))))))) is different from false [2024-06-21 16:09:16,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (mod c_~buffer_size~0 4294967296)) (.cse22 (mod c_~next~0 4294967296))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse2 (< .cse20 (+ .cse22 1))) (.cse5 (< c_~buffer_size~0 1)) (.cse8 (= (mod c_~receive~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse10)) (.cse16 (< 0 .cse18)) (.cse17 (< .cse15 0)) (.cse13 (not .cse8)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse9 (or .cse2 .cse5)) (.cse6 (not .cse3)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse21 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse20 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse20 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse22 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse20) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (or .cse1 .cse7 .cse8 (and .cse9 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse0 (= .cse15 0) .cse2 .cse3 .cse16 .cse17 .cse5) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse14) (or (and (or .cse7 .cse8 .cse11 .cse12 (and (not (= .cse18 0)) .cse9) .cse16 .cse17) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse6) (let ((.cse19 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse19) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse7 .cse8 (and (not (= .cse19 0)) .cse9) .cse6 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse4 .cse5)))))))) is different from false [2024-06-21 16:09:17,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse2 (< .cse21 (+ .cse23 1))) (.cse5 (< c_~buffer_size~0 1)) (.cse10 (= (mod c_~receive~0 256) 0)) (.cse16 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse19 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse11)) (.cse17 (< 0 .cse19)) (.cse18 (< .cse16 0)) (.cse14 (not .cse10)) (.cse15 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse6 (or .cse2 .cse5)) (.cse8 (not .cse3)) (.cse12 (< 2147483647 c_~value~0)) (.cse13 (and (or (let ((.cse22 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse21 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse21 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse23 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse21) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse6 (not (= .cse7 0))) .cse3 .cse4 (< 0 .cse7))) (or .cse8 (and (or .cse1 .cse9 .cse10 (and .cse6 (not (= .cse11 0))) .cse12 .cse13 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse14 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15))) (or .cse0 (= .cse16 0) .cse2 .cse3 .cse17 .cse18 .cse5) (or .cse8 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15) (or .cse14 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse8 .cse15) (or (and (or .cse9 .cse10 .cse12 .cse13 (and (not (= .cse19 0)) .cse6) .cse17 .cse18) (or .cse14 .cse15 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse8) (let ((.cse20 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse20) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse9 .cse10 (and (not (= .cse20 0)) .cse6) .cse8 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5)))))))) is different from false [2024-06-21 16:09:33,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-21 16:09:35,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse2 (< .cse22 (+ .cse24 1))) (.cse5 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse8 (= (mod c_~receive~0 256) 0)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse9 (or .cse2 .cse5)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse10)) (.cse15 (and .cse9 (not (= .cse25 0)))) (.cse16 (< 0 .cse25)) (.cse18 (< 0 .cse20)) (.cse19 (< .cse17 0)) (.cse13 (not .cse8)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse6 (not .cse3)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse22 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse22 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse24 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (or .cse1 .cse7 .cse8 (and .cse9 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse13 (and (or .cse15 .cse3 .cse4 .cse16) (or .cse6 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse0 (= .cse17 0) .cse2 .cse3 .cse18 .cse19 .cse5) (or .cse15 .cse7 .cse8 .cse4 .cse11 .cse12 .cse16) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse14) (or (and (or .cse7 .cse8 .cse11 .cse12 (and (not (= .cse20 0)) .cse9) .cse18 .cse19) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse6) (let ((.cse21 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse21) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse7 .cse8 (and (not (= .cse21 0)) .cse9) .cse6 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse4 .cse5)))) (= c_~value~0 4)))))) is different from false [2024-06-21 16:09:46,843 INFO L124 PetriNetUnfolderBase]: 16016/28952 cut-off events. [2024-06-21 16:09:46,843 INFO L125 PetriNetUnfolderBase]: For 133575/133575 co-relation queries the response was YES. [2024-06-21 16:09:46,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96999 conditions, 28952 events. 16016/28952 cut-off events. For 133575/133575 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 229894 event pairs, 1093 based on Foata normal form. 586/29535 useless extension candidates. Maximal degree in co-relation 96813. Up to 5407 conditions per place. [2024-06-21 16:09:46,989 INFO L140 encePairwiseOnDemand]: 15/29 looper letters, 621 selfloop transitions, 728 changer transitions 48/1399 dead transitions. [2024-06-21 16:09:46,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1399 transitions, 13296 flow [2024-06-21 16:09:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-06-21 16:09:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2024-06-21 16:09:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 1163 transitions. [2024-06-21 16:09:46,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141467727674625 [2024-06-21 16:09:46,993 INFO L175 Difference]: Start difference. First operand has 131 places, 207 transitions, 1853 flow. Second operand 78 states and 1163 transitions. [2024-06-21 16:09:46,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1399 transitions, 13296 flow [2024-06-21 16:09:47,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1399 transitions, 12936 flow, removed 168 selfloop flow, removed 9 redundant places. [2024-06-21 16:09:47,630 INFO L231 Difference]: Finished difference. Result has 242 places, 882 transitions, 11225 flow [2024-06-21 16:09:47,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=11225, PETRI_PLACES=242, PETRI_TRANSITIONS=882} [2024-06-21 16:09:47,631 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-21 16:09:47,631 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 882 transitions, 11225 flow [2024-06-21 16:09:47,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 29 states have internal predecessors, (225), 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-21 16:09:47,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 16:09:47,631 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 16:09:47,637 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-21 16:09:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:09:47,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-21 16:09:47,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 16:09:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1368888569, now seen corresponding path program 2 times [2024-06-21 16:09:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 16:09:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326027744] [2024-06-21 16:09:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 16:09:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 16:09:47,866 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-21 16:09:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100360940] [2024-06-21 16:09:47,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-21 16:09:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-21 16:09:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 16:09:47,867 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-21 16:09:47,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-21 16:09:48,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-21 16:09:48,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-21 16:09:48,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjunts are in the unsatisfiable core [2024-06-21 16:09:48,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-21 16:09:48,160 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-21 16:09:48,163 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-21 16:09:48,166 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-21 16:09:49,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2024-06-21 16:09:49,226 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 11 treesize of output 3 [2024-06-21 16:09:49,231 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 12 treesize of output 3 [2024-06-21 16:09:49,241 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-21 16:09:49,356 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-21 16:09:52,016 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-21 16:09:52,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2024-06-21 16:09:52,026 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 3 [2024-06-21 16:09:52,042 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-21 16:09:52,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 8 treesize of output 1 [2024-06-21 16:09:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 16:09:53,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-21 16:09:55,811 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 11 treesize of output 4 [2024-06-21 16:09:55,817 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 10 treesize of output 4 [2024-06-21 16:09:58,058 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 11 treesize of output 4 [2024-06-21 16:09:58,108 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 10 treesize of output 4 [2024-06-21 16:10:00,011 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#ghost~multithreaded| 0) (let ((.cse0 (mod c_~next~0 4294967296)) (.cse2 (mod c_~buffer_size~0 4294967296))) (let ((.cse7 (= (mod c_~receive~0 256) 0)) (.cse5 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse2) 1)) (.cse6 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse8 (< .cse2 (+ .cse0 1))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse10 (< c_~buffer_size~0 1))) (and (or (and (or (not (= (+ c_~value~0 1) 0)) (< 0 .cse0)) (or (< .cse0 1) (let ((.cse1 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse3 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse1 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse2 (+ .cse3 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse3 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse4 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse1 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse2 (+ .cse4 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse4 v_z_72) 0)))))))) .cse5 .cse6 (< (+ c_~value~0 2147483648) 0) .cse7 .cse8 .cse9 (< 2147483647 c_~value~0) .cse10) (or (not .cse7) (let ((.cse11 (= (mod c_~send~0 256) 0))) (and (or .cse5 .cse6 .cse8 .cse11 .cse9 .cse10) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse11) (and (<= c_~value~0 6) (<= 0 c_~value~0)))))))))) is different from false [2024-06-21 16:10:02,019 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 9 treesize of output 1 [2024-06-21 16:10:02,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-06-21 16:10:02,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-06-21 16:10:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-06-21 16:10:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 16:10:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326027744] [2024-06-21 16:10:03,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-21 16:10:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100360940] [2024-06-21 16:10:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100360940] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-21 16:10:03,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-21 16:10:03,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 29 [2024-06-21 16:10:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745090154] [2024-06-21 16:10:03,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-21 16:10:03,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-21 16:10:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 16:10:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-21 16:10:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=633, Unknown=2, NotChecked=56, Total=930 [2024-06-21 16:10:03,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-21 16:10:03,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 882 transitions, 11225 flow. Second operand has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 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-21 16:10:03,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 16:10:03,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-21 16:10:03,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 16:10:05,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296)) (.cse31 (mod c_~first~0 4294967296))) (let ((.cse30 (+ .cse31 1)) (.cse16 (< .cse24 (+ .cse21 1))) (.cse18 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse24 .cse30)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse28 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (not .cse28)) (.cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse21) (<= .cse30 .cse24)) .cse20) (or .cse17 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse22))) (.cse13 (and (not (= .cse29 0)) .cse1)) (.cse19 (< .cse15 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< 0 .cse29)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 .cse8) (or .cse9 (and (or .cse10 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12 .cse13) (or .cse14 (= .cse15 0) .cse16 .cse17 .cse3 .cse18)) .cse19))) (or .cse7 .cse5 .cse6) (or .cse0 .cse6) (or .cse0 (let ((.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse14 .cse27 .cse10 .cse28 .cse16 .cse4 .cse11 .cse18) (or .cse7 (and (or .cse14 .cse27 .cse16 .cse3 .cse4 .cse18) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))) (or .cse0 (and (or .cse7 (and (or .cse5 .cse6 .cse8) (or .cse3 .cse13 .cse9 .cse19))) (or .cse10 .cse28 .cse11 .cse12 .cse13 .cse9 .cse19))) (or .cse0 (and (or .cse3 .cse9) (or .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6)))))))) is different from false [2024-06-21 16:10:13,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse9 (mod c_~buffer_size~0 4294967296)) (.cse23 (= (mod c_~receive~0 256) 0)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse0 (= |c_#ghost~multithreaded| 0)) (.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse1 (not .cse23)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (< .cse9 (+ .cse7 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (and (or (< 2147483647 .cse12) (not (= c_~value~0 (select .cse13 (+ |c_~#buffer~0.offset| .cse12))))) (or (not (= (select .cse13 (+ |c_~#buffer~0.offset| .cse12 (- 4294967296))) c_~value~0)) (< .cse12 2147483648))) .cse14)) (and (not (= .cse4 0)) (or .cse15 .cse16))) (or .cse17 (= .cse18 0) .cse15 .cse11 .cse19 .cse16))))) (< .cse18 0))))) (or .cse1 .cse2 .cse3) (or .cse0 (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse20 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse20 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse20 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse21 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse21 v_z_72) 0))))))) .cse17 .cse22 .cse5 .cse23 .cse15 .cse24 .cse6 .cse16) (or .cse1 (and (or .cse17 .cse22 .cse15 .cse19 .cse24 .cse16) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3))))))))) is different from false [2024-06-21 16:10:22,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse18 (< .cse9 (+ .cse7 1))) (.cse20 (< c_~buffer_size~0 1)) (.cse24 (= (mod c_~receive~0 256) 0))) (let ((.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse1 (not .cse24)) (.cse16 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (or .cse18 .cse20)) (.cse25 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (and (or (< 2147483647 .cse12) (not (= c_~value~0 (select .cse13 (+ |c_~#buffer~0.offset| .cse12))))) (or (not (= (select .cse13 (+ |c_~#buffer~0.offset| .cse12 (- 4294967296))) c_~value~0)) (< .cse12 2147483648))) .cse14)) (and (not (= .cse4 0)) .cse15)) (or .cse16 (= .cse17 0) .cse18 .cse11 .cse19 .cse20))))) (< .cse17 0))))) (or .cse1 .cse2 .cse3) (or .cse0 (let ((.cse23 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse21 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse21 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse22 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse22 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse22 v_z_72) 0))))))) .cse16 .cse23 .cse5 .cse24 .cse18 .cse25 .cse6 .cse20) (or .cse1 (and (or .cse16 .cse23 .cse18 .cse19 .cse25 .cse20) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3)))))) (or (and (let ((.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse15 (not (= .cse26 0))) .cse19 .cse25 (< 0 .cse26))) (or .cse2 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse3)) .cse0))))) is different from false [2024-06-21 16:10:24,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse18 (< .cse9 (+ .cse7 1))) (.cse20 (< c_~buffer_size~0 1)) (.cse24 (= (mod c_~receive~0 256) 0))) (let ((.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse1 (not .cse24)) (.cse16 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (or .cse18 .cse20)) (.cse25 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (and (or (< 2147483647 .cse12) (not (= c_~value~0 (select .cse13 (+ |c_~#buffer~0.offset| .cse12))))) (or (not (= (select .cse13 (+ |c_~#buffer~0.offset| .cse12 (- 4294967296))) c_~value~0)) (< .cse12 2147483648))) .cse14)) (and (not (= .cse4 0)) .cse15)) (or .cse16 (= .cse17 0) .cse18 .cse11 .cse19 .cse20))))) (< .cse17 0))))) (or .cse0 (let ((.cse23 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse21 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse21 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse22 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse22 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse22 v_z_72) 0))))))) .cse16 .cse23 .cse5 .cse24 .cse18 .cse25 .cse6 .cse20) (or .cse1 (and (or .cse16 .cse23 .cse18 .cse19 .cse25 .cse20) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3)))))) (or (and (let ((.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse15 (not (= .cse26 0))) .cse19 .cse25 (< 0 .cse26))) (or .cse2 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse3)) .cse0))))) is different from false [2024-06-21 16:10:34,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse24 (= (mod c_~receive~0 256) 0)) (.cse18 (< .cse9 (+ .cse7 1))) (.cse20 (< c_~buffer_size~0 1))) (let ((.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse16 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (or .cse18 .cse20)) (.cse25 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse1 (not .cse24)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (and (or (< 2147483647 .cse12) (not (= c_~value~0 (select .cse13 (+ |c_~#buffer~0.offset| .cse12))))) (or (not (= (select .cse13 (+ |c_~#buffer~0.offset| .cse12 (- 4294967296))) c_~value~0)) (< .cse12 2147483648))) .cse14)) (and (not (= .cse4 0)) .cse15)) (or .cse16 (= .cse17 0) .cse18 .cse11 .cse19 .cse20))))) (< .cse17 0))))) (or .cse0 (let ((.cse23 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse21 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse21 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse22 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse22 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse22 v_z_72) 0))))))) .cse16 .cse23 .cse5 .cse24 .cse18 .cse25 .cse6 .cse20) (or .cse1 (and (or .cse16 .cse23 .cse18 .cse19 .cse25 .cse20) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3)))))) (or (and (let ((.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse15 (not (= .cse26 0))) .cse19 .cse25 (< 0 .cse26))) (or .cse2 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse3)) .cse0) (or .cse1 .cse0 .cse2 .cse3))))) is different from false [2024-06-21 16:10:35,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod c_~first~0 4294967296)) (.cse26 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse16 (< .cse26 (+ .cse23 1))) (.cse18 (< c_~buffer_size~0 1)) (.cse32 (+ .cse33 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse29 (= (mod c_~receive~0 256) 0)) (.cse22 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse26 .cse32)) (.cse25 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse24 (< .cse23 1)) (.cse35 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse34 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18))) (let ((.cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (and (not (= .cse34 0)) .cse1)) (.cse15 (= .cse35 0)) (.cse21 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse19 (< .cse35 0)) (.cse20 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (< 0 .cse34)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse26) 1)) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse10 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse23) (<= .cse32 .cse26)) .cse22) (or .cse17 (and (or (< 2147483647 .cse33) (not (= c_~value~0 (select .cse25 (+ |c_~#buffer~0.offset| .cse33))))) (or (not (= (select .cse25 (+ |c_~#buffer~0.offset| .cse33 (- 4294967296))) c_~value~0)) (< .cse33 2147483648))) .cse24))) (.cse6 (not .cse29)) (.cse4 (not .cse3)) (.cse5 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) (< 0 .cse2))) (or .cse4 .cse5)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse6 .cse4 .cse5 .cse7) (or .cse8 (and (or .cse9 .cse4 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse3 .cse18)) .cse19))) (or (and (or .cse6 (and (or .cse20 .cse4 .cse5) (or .cse14 .cse16 .cse21 .cse3 .cse19 .cse18))) (or (and (or .cse22 (< 0 .cse23)) (or .cse24 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse27 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse26 (+ .cse27 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse27 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse28 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse26 (+ .cse28 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse28 v_z_72) 0))))))) .cse14 .cse9 .cse29 .cse16 .cse21 .cse11 .cse19 .cse18)) .cse0) (or .cse0 .cse5) (or .cse0 (and (or .cse6 (and (or .cse4 .cse5 .cse7) (or .cse3 .cse13 .cse8 .cse19))) (or .cse9 .cse29 .cse11 .cse12 .cse13 .cse8 .cse19))) (or .cse0 (and (or .cse15 .cse21 .cse3 .cse19) (or .cse4 (and (or .cse9 .cse29 .cse21 .cse11 .cse19) (or .cse6 .cse20 .cse5))))) (or .cse0 (and (or .cse3 .cse8) (or .cse4 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5))) (or .cse0 (and (let ((.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse30) (and (or .cse14 .cse16 .cse17 .cse3 (= .cse31 0) .cse18) (or .cse9 .cse4 .cse10 (and .cse1 (not (= .cse30 0))) .cse11 .cse12)) (< .cse31 0))) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse4 .cse5)))))))) is different from false [2024-06-21 16:10:36,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod c_~first~0 4294967296)) (.cse26 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse16 (< .cse26 (+ .cse23 1))) (.cse18 (< c_~buffer_size~0 1)) (.cse32 (+ .cse33 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse29 (= (mod c_~receive~0 256) 0)) (.cse22 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse26 .cse32)) (.cse25 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse24 (< .cse23 1)) (.cse35 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse34 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18))) (let ((.cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (and (not (= .cse34 0)) .cse1)) (.cse15 (= .cse35 0)) (.cse21 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse19 (< .cse35 0)) (.cse20 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (< 0 .cse34)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse26) 1)) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse10 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse23) (<= .cse32 .cse26)) .cse22) (or .cse17 (and (or (< 2147483647 .cse33) (not (= c_~value~0 (select .cse25 (+ |c_~#buffer~0.offset| .cse33))))) (or (not (= (select .cse25 (+ |c_~#buffer~0.offset| .cse33 (- 4294967296))) c_~value~0)) (< .cse33 2147483648))) .cse24))) (.cse6 (not .cse29)) (.cse4 (not .cse3)) (.cse5 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) (< 0 .cse2))) (or .cse4 .cse5)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse6 .cse4 .cse5 .cse7) (or .cse8 (and (or .cse9 .cse4 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse3 .cse18)) .cse19))) (or (and (or .cse6 (and (or .cse20 .cse4 .cse5) (or .cse14 .cse16 .cse21 .cse3 .cse19 .cse18))) (or (and (or .cse22 (< 0 .cse23)) (or .cse24 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse27 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse26 (+ .cse27 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse27 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse28 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse26 (+ .cse28 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse28 v_z_72) 0))))))) .cse14 .cse9 .cse29 .cse16 .cse21 .cse11 .cse19 .cse18)) .cse0) (or .cse6 .cse4 .cse5) (or .cse0 .cse5) (or .cse0 (and (or .cse6 (and (or .cse4 .cse5 .cse7) (or .cse3 .cse13 .cse8 .cse19))) (or .cse9 .cse29 .cse11 .cse12 .cse13 .cse8 .cse19))) (or .cse0 (and (or .cse15 .cse21 .cse3 .cse19) (or .cse4 (and (or .cse9 .cse29 .cse21 .cse11 .cse19) (or .cse6 .cse20 .cse5))))) (or .cse0 (and (or .cse3 .cse8) (or .cse4 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5))) (or .cse0 (and (let ((.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse30) (and (or .cse14 .cse16 .cse17 .cse3 (= .cse31 0) .cse18) (or .cse9 .cse4 .cse10 (and .cse1 (not (= .cse30 0))) .cse11 .cse12)) (< .cse31 0))) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse4 .cse5)))))))) is different from false [2024-06-21 16:10:45,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296)) (.cse31 (mod c_~first~0 4294967296))) (let ((.cse30 (+ .cse31 1)) (.cse16 (< .cse24 (+ .cse21 1))) (.cse18 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse24 .cse30)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse28 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (not .cse28)) (.cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse21) (<= .cse30 .cse24)) .cse20) (or .cse17 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse22))) (.cse13 (and (not (= .cse29 0)) .cse1)) (.cse19 (< .cse15 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< 0 .cse29)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 .cse8) (or .cse9 (and (or .cse10 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12 .cse13) (or .cse14 (= .cse15 0) .cse16 .cse17 .cse3 .cse18)) .cse19))) (or .cse0 (let ((.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse14 .cse27 .cse10 .cse28 .cse16 .cse4 .cse11 .cse18) (or .cse7 (and (or .cse14 .cse27 .cse16 .cse3 .cse4 .cse18) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))) (= |c_#ghost~multithreaded| 1) (or .cse0 (and (or .cse7 (and (or .cse5 .cse6 .cse8) (or .cse3 .cse13 .cse9 .cse19))) (or .cse10 .cse28 .cse11 .cse12 .cse13 .cse9 .cse19))) (= c_~value~0 3) (or .cse0 (and (or .cse3 .cse9) (or .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6)))))))) is different from false [2024-06-21 16:10:52,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod c_~first~0 4294967296)) (.cse26 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse16 (< .cse26 (+ .cse23 1))) (.cse18 (< c_~buffer_size~0 1)) (.cse32 (+ .cse33 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse29 (= (mod c_~receive~0 256) 0)) (.cse22 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse26 .cse32)) (.cse25 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse24 (< .cse23 1)) (.cse35 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse34 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18))) (let ((.cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (and (not (= .cse34 0)) .cse1)) (.cse15 (= .cse35 0)) (.cse21 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse19 (< .cse35 0)) (.cse20 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (< 0 .cse34)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse26) 1)) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse10 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse23) (<= .cse32 .cse26)) .cse22) (or .cse17 (and (or (< 2147483647 .cse33) (not (= c_~value~0 (select .cse25 (+ |c_~#buffer~0.offset| .cse33))))) (or (not (= (select .cse25 (+ |c_~#buffer~0.offset| .cse33 (- 4294967296))) c_~value~0)) (< .cse33 2147483648))) .cse24))) (.cse6 (not .cse29)) (.cse4 (not .cse3)) (.cse5 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) (< 0 .cse2))) (or .cse4 .cse5)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse6 .cse4 .cse5 .cse7) (or .cse8 (and (or .cse9 .cse4 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse3 .cse18)) .cse19))) (or (and (or .cse6 (and (or .cse20 .cse4 .cse5) (or .cse14 .cse16 .cse21 .cse3 .cse19 .cse18))) (or (and (or .cse22 (< 0 .cse23)) (or .cse24 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse27 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse26 (+ .cse27 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse27 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse28 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse26 (+ .cse28 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse28 v_z_72) 0))))))) .cse14 .cse9 .cse29 .cse16 .cse21 .cse11 .cse19 .cse18)) .cse0) (= |c_#ghost~multithreaded| 1) (or .cse0 (and (or .cse6 (and (or .cse4 .cse5 .cse7) (or .cse3 .cse13 .cse8 .cse19))) (or .cse9 .cse29 .cse11 .cse12 .cse13 .cse8 .cse19))) (or .cse0 (and (or .cse15 .cse21 .cse3 .cse19) (or .cse4 (and (or .cse9 .cse29 .cse21 .cse11 .cse19) (or .cse6 .cse20 .cse5))))) (= c_~value~0 3) (or .cse0 (and (or .cse3 .cse8) (or .cse4 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5))) (or .cse0 (and (let ((.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse30) (and (or .cse14 .cse16 .cse17 .cse3 (= .cse31 0) .cse18) (or .cse9 .cse4 .cse10 (and .cse1 (not (= .cse30 0))) .cse11 .cse12)) (< .cse31 0))) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse4 .cse5)))))))) is different from false [2024-06-21 16:11:08,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (= (mod c_~receive~0 256) 0)) (.cse19 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (= (mod c_~send~0 256) 0))) (let ((.cse18 (= |c_#ghost~multithreaded| 0)) (.cse2 (not .cse7)) (.cse15 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse17 (< 2147483647 c_~value~0)) (.cse8 (< .cse19 0)) (.cse0 (not .cse16)) (.cse1 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or (let ((.cse10 (mod c_~next~0 4294967296)) (.cse12 (mod c_~buffer_size~0 4294967296))) (let ((.cse4 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse12) 1)) (.cse5 (< .cse12 (+ .cse10 1))) (.cse9 (< c_~buffer_size~0 1))) (and (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (or (and (or (not (= (+ c_~value~0 1) 0)) (< 0 .cse10)) (or (< .cse10 1) (let ((.cse11 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse13 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse11 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse12 (+ .cse13 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse13 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse14 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse11 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse12 (+ .cse14 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse14 v_z_72) 0)))))))) .cse4 .cse15 .cse16 .cse5 .cse6 .cse17 .cse8 .cse9)))) .cse18) (or .cse18 (and (or (= .cse19 0) .cse6 .cse7 .cse8) (or .cse2 (and (or .cse15 .cse16 .cse6 .cse17 .cse8) (or .cse0 .cse1 .cse3)))))))) is different from false [2024-06-21 16:11:12,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= (mod c_~send~0 256) 0)) (.cse10 (mod c_~buffer_size~0 4294967296)) (.cse8 (mod c_~next~0 4294967296))) (let ((.cse1 (< .cse10 (+ .cse8 1))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (not .cse4)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse1 .cse2) (not (= .cse3 0))) .cse4 .cse5 (< 0 .cse3))) (or .cse6 .cse7)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 .cse7) (or .cse0 (let ((.cse15 (= (mod c_~receive~0 256) 0)) (.cse13 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse10) 1)) (.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or (not (= (+ c_~value~0 1) 0)) (< 0 .cse8)) (or (< .cse8 1) (let ((.cse9 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse11 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse9 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse10 (+ .cse11 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse11 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse12 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse9 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse10 (+ .cse12 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse12 v_z_72) 0)))))))) .cse13 .cse14 (< (+ c_~value~0 2147483648) 0) .cse15 .cse1 .cse5 (< 2147483647 c_~value~0) .cse2) (or (not .cse15) (and (or .cse13 .cse14 .cse1 .cse4 .cse5 .cse2) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse7)))))) (or .cse0 (and (or .cse4 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (or .cse6 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7)))))) is different from false [2024-06-21 16:11:16,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296)) (.cse31 (mod c_~first~0 4294967296))) (let ((.cse30 (+ .cse31 1)) (.cse16 (< .cse24 (+ .cse21 1))) (.cse18 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse24 .cse30)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse28 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (not .cse28)) (.cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse21) (<= .cse30 .cse24)) .cse20) (or .cse17 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse22))) (.cse13 (and (not (= .cse29 0)) .cse1)) (.cse19 (< .cse15 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< 0 .cse29)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 .cse8) (or .cse9 (and (or .cse10 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12 .cse13) (or .cse14 (= .cse15 0) .cse16 .cse17 .cse3 .cse18)) .cse19))) (or .cse0 .cse6) (or .cse0 (let ((.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse14 .cse27 .cse10 .cse28 .cse16 .cse4 .cse11 .cse18) (or .cse7 (and (or .cse14 .cse27 .cse16 .cse3 .cse4 .cse18) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))) (or .cse0 (and (or .cse7 (and (or .cse5 .cse6 .cse8) (or .cse3 .cse13 .cse9 .cse19))) (or .cse10 .cse28 .cse11 .cse12 .cse13 .cse9 .cse19))) (or .cse0 (and (or .cse3 .cse9) (or .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6)))))))) is different from false [2024-06-21 16:11:18,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296))) (let ((.cse33 (mod c_~first~0 4294967296)) (.cse13 (< .cse24 (+ .cse21 1))) (.cse16 (< c_~buffer_size~0 1))) (let ((.cse34 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse35 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse31 (or .cse13 .cse16)) (.cse15 (= (mod c_~send~0 256) 0)) (.cse32 (+ .cse33 1))) (let ((.cse27 (= (mod c_~receive~0 256) 0)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse24 .cse32)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse2 (not .cse15)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (and (not (= .cse35 0)) .cse31)) (.cse5 (< 0 .cse35)) (.cse17 (< .cse34 0))) (let ((.cse28 (and (or .cse2 .cse3 .cse4) (or .cse15 .cse10 .cse5 .cse17))) (.cse12 (= .cse34 0)) (.cse19 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse18 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse11 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse6 (< (+ c_~value~0 2147483648) 0)) (.cse7 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse8 (< 2147483647 c_~value~0)) (.cse9 (and (or (and (<= 1 .cse21) (<= .cse32 .cse24)) .cse20) (or .cse14 (and (or (< 2147483647 .cse33) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse33))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse33 (- 4294967296))) c_~value~0)) (< .cse33 2147483648))) .cse22))) (.cse1 (not .cse27))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse5 (and (or .cse6 .cse2 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) .cse17))) (or (and (or .cse1 (and (or .cse18 .cse2 .cse3) (or .cse11 .cse13 .cse19 .cse15 .cse17 .cse16))) (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse11 .cse6 .cse27 .cse13 .cse19 .cse8 .cse17 .cse16)) .cse0) (or .cse0 .cse3) (or .cse0 .cse28) (or .cse0 (and (or .cse1 .cse28) (or .cse6 .cse27 .cse8 .cse9 .cse10 .cse5 .cse17))) (or .cse0 (and (or .cse12 .cse19 .cse15 .cse17) (or .cse2 (and (or .cse6 .cse27 .cse19 .cse8 .cse17) (or .cse1 .cse18 .cse3))))) (or .cse0 (and (let ((.cse29 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse30 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse29) (and (or .cse11 .cse13 .cse14 .cse15 (= .cse30 0) .cse16) (or .cse6 .cse2 .cse7 (and .cse31 (not (= .cse29 0))) .cse8 .cse9)) (< .cse30 0))) (or .cse1 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3))))))))) is different from false [2024-06-21 16:11:18,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (mod c_~first~0 4294967296)) (.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296))) (let ((.cse13 (< .cse24 (+ .cse21 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse31 (+ .cse32 1))) (let ((.cse15 (= (mod c_~send~0 256) 0)) (.cse27 (= (mod c_~receive~0 256) 0)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse24 .cse31)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse33 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse34 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse30 (or .cse13 .cse16))) (let ((.cse4 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (and (not (= .cse34 0)) .cse30)) (.cse5 (< 0 .cse34)) (.cse12 (= .cse33 0)) (.cse19 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse17 (< .cse33 0)) (.cse18 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse11 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse6 (< (+ c_~value~0 2147483648) 0)) (.cse7 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse8 (< 2147483647 c_~value~0)) (.cse9 (and (or (and (<= 1 .cse21) (<= .cse31 .cse24)) .cse20) (or .cse14 (and (or (< 2147483647 .cse32) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse32))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse32 (- 4294967296))) c_~value~0)) (< .cse32 2147483648))) .cse22))) (.cse1 (not .cse27)) (.cse2 (not .cse15)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse5 (and (or .cse6 .cse2 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) .cse17))) (or (and (or .cse1 (and (or .cse18 .cse2 .cse3) (or .cse11 .cse13 .cse19 .cse15 .cse17 .cse16))) (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse11 .cse6 .cse27 .cse13 .cse19 .cse8 .cse17 .cse16)) .cse0) (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse15 .cse10 .cse5 .cse17))) (or .cse6 .cse27 .cse8 .cse9 .cse10 .cse5 .cse17))) (or .cse1 .cse0 .cse2 .cse3) (or .cse0 (and (or .cse12 .cse19 .cse15 .cse17) (or .cse2 (and (or .cse6 .cse27 .cse19 .cse8 .cse17) (or .cse1 .cse18 .cse3))))) (or .cse0 (and (let ((.cse28 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse29 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse28) (and (or .cse11 .cse13 .cse14 .cse15 (= .cse29 0) .cse16) (or .cse6 .cse2 .cse7 (and .cse30 (not (= .cse28 0))) .cse8 .cse9)) (< .cse29 0))) (or .cse1 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3)))))))) is different from false [2024-06-21 16:11:20,763 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse29 (mod c_~first~0 4294967296))) (let ((.cse10 (mod c_~next~0 4294967296)) (.cse13 (mod c_~buffer_size~0 4294967296)) (.cse28 (+ .cse29 1))) (let ((.cse6 (= (mod c_~send~0 256) 0)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse9 (not (= (+ c_~value~0 1) 0))) (.cse26 (< .cse13 .cse28)) (.cse12 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse11 (< .cse10 1)) (.cse4 (< .cse13 (+ .cse10 1))) (.cse8 (< c_~buffer_size~0 1))) (let ((.cse7 (< (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse19 (= |c_#ghost~multithreaded| 0)) (.cse3 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse13) 1)) (.cse16 (< (+ c_~value~0 2147483648) 0)) (.cse24 (or .cse4 .cse8)) (.cse18 (< 2147483647 c_~value~0)) (.cse22 (and (or (and (<= 1 .cse10) (<= .cse28 .cse13)) .cse9) (or .cse26 (and (or (< 2147483647 .cse29) (not (= c_~value~0 (select .cse12 (+ |c_~#buffer~0.offset| .cse29))))) (or (not (= (select .cse12 (+ |c_~#buffer~0.offset| .cse29 (- 4294967296))) c_~value~0)) (< .cse29 2147483648))) .cse11))) (.cse0 (not .cse17)) (.cse1 (not .cse6)) (.cse2 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or (let ((.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse0 (and (or (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (or (and (or .cse9 (< 0 .cse10)) (or .cse11 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse14 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse12 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse13 (+ .cse14 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse14 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse15 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse12 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse13 (+ .cse15 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse15 v_z_72) 0))))))) .cse3 .cse16 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8))) .cse19) (or .cse19 (let ((.cse23 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse20 (and (not (= .cse23 0)) .cse24)) (.cse21 (< 0 .cse23))) (and (or .cse0 (and (or .cse1 .cse2 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse6 .cse20 .cse21 .cse7))) (or .cse16 .cse17 .cse18 .cse22 .cse20 .cse21 .cse7))))) (or .cse19 (and (let ((.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse27 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse25) (and (or .cse3 .cse4 .cse26 .cse6 (= .cse27 0) .cse8) (or .cse16 .cse1 (= (* 256 (div c_~receive~0 256)) c_~receive~0) (and .cse24 (not (= .cse25 0))) .cse18 .cse22)) (< .cse27 0))) (or .cse0 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse1 .cse2)))))))) is different from false [2024-06-21 16:11:30,114 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse23 (= (mod c_~receive~0 256) 0)) (.cse9 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (< .cse9 (+ .cse7 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse1 (not .cse23)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (and (or (< 2147483647 .cse12) (not (= c_~value~0 (select .cse13 (+ |c_~#buffer~0.offset| .cse12))))) (or (not (= (select .cse13 (+ |c_~#buffer~0.offset| .cse12 (- 4294967296))) c_~value~0)) (< .cse12 2147483648))) .cse14)) (and (not (= .cse4 0)) (or .cse15 .cse16))) (or .cse17 (= .cse18 0) .cse15 .cse11 .cse19 .cse16))))) (< .cse18 0))))) (or .cse0 (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse20 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse20 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse20 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse21 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse21 v_z_72) 0))))))) .cse17 .cse22 .cse5 .cse23 .cse15 .cse24 .cse6 .cse16) (or .cse1 (and (or .cse17 .cse22 .cse15 .cse19 .cse24 .cse16) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3)))))) (or .cse1 .cse0 .cse2 .cse3)))) is different from false