./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-05-21_14-57-05.files/protection/circular_buffer_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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-05-21_14-57-05.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-bcb38a6-m [2024-06-03 19:02:14,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 19:02:14,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 19:02:14,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 19:02:14,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 19:02:14,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 19:02:14,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 19:02:14,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 19:02:14,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 19:02:14,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 19:02:14,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 19:02:14,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 19:02:14,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 19:02:14,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 19:02:14,641 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 19:02:14,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 19:02:14,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 19:02:14,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 19:02:14,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 19:02:14,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 19:02:14,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 19:02:14,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 19:02:14,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 19:02:14,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 19:02:14,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 19:02:14,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 19:02:14,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 19:02:14,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 19:02:14,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 19:02:14,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 19:02:14,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 19:02:14,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 19:02:14,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:02:14,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 19:02:14,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 19:02:14,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 19:02:14,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 19:02:14,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 19:02:14,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 19:02:14,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 19:02:14,649 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 19:02:14,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 19:02:14,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 19:02:14,649 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-03 19:02:14,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 19:02:14,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 19:02:14,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 19:02:14,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 19:02:14,925 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 19:02:14,926 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-03 19:02:16,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 19:02:16,311 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 19:02:16,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-03 19:02:16,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b14b0b8/b6976ed3598a4c2cbffaba1ffcff1aa9/FLAGb3e2c7a1f [2024-06-03 19:02:16,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b14b0b8/b6976ed3598a4c2cbffaba1ffcff1aa9 [2024-06-03 19:02:16,342 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 19:02:16,343 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 19:02:16,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/circular_buffer_ok.yml/witness.yml [2024-06-03 19:02:16,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 19:02:16,446 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 19:02:16,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 19:02:16,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 19:02:16,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 19:02:16,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:02:16" (1/2) ... [2024-06-03 19:02:16,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91f8d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:02:16, skipping insertion in model container [2024-06-03 19:02:16,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:02:16" (1/2) ... [2024-06-03 19:02:16,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b19ac27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:02:16, skipping insertion in model container [2024-06-03 19:02:16,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:02:16" (2/2) ... [2024-06-03 19:02:16,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91f8d6e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:16, skipping insertion in model container [2024-06-03 19:02:16,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:02:16" (2/2) ... [2024-06-03 19:02:16,458 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 19:02:16,493 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 19:02:16,495 INFO L97 edCorrectnessWitness]: Location invariant before [L765-L765] ! multithreaded || (0 <= value && value <= 6) [2024-06-03 19:02:16,495 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] ! multithreaded || (0 <= value && value <= 6) [2024-06-03 19:02:16,495 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 19:02:16,495 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-03 19:02:16,495 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-06-03 19:02:16,496 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-06-03 19:02:16,496 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-06-03 19:02:16,497 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-06-03 19:02:16,497 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-06-03 19:02:16,546 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 19:02:16,867 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:02:16,889 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-03 19:02:17,016 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:02:17,063 INFO L206 MainTranslator]: Completed translation [2024-06-03 19:02:17,064 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17 WrapperNode [2024-06-03 19:02:17,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 19:02:17,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 19:02:17,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 19:02:17,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 19:02:17,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,119 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-06-03 19:02:17,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 19:02:17,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 19:02:17,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 19:02:17,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 19:02:17,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,150 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-03 19:02:17,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 19:02:17,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 19:02:17,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 19:02:17,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 19:02:17,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (1/1) ... [2024-06-03 19:02:17,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:02:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:02:17,275 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-03 19:02:17,277 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-03 19:02:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 19:02:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 19:02:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-03 19:02:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-03 19:02:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-03 19:02:17,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-03 19:02:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-03 19:02:17,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-03 19:02:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 19:02:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 19:02:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-03 19:02:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-03 19:02:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-03 19:02:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 19:02:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-03 19:02:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-03 19:02:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-03 19:02:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-06-03 19:02:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 19:02:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 19:02:17,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-03 19:02:17,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-03 19:02:17,308 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-03 19:02:17,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 19:02:17,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 19:02:17,310 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 19:02:17,442 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 19:02:17,444 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 19:02:17,768 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 19:02:17,769 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 19:02:18,019 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 19:02:18,019 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-03 19:02:18,021 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:02:18 BoogieIcfgContainer [2024-06-03 19:02:18,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 19:02:18,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 19:02:18,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 19:02:18,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 19:02:18,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 07:02:16" (1/4) ... [2024-06-03 19:02:18,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cd510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:02:18, skipping insertion in model container [2024-06-03 19:02:18,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:02:16" (2/4) ... [2024-06-03 19:02:18,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cd510 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 07:02:18, skipping insertion in model container [2024-06-03 19:02:18,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:02:17" (3/4) ... [2024-06-03 19:02:18,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cd510 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 07:02:18, skipping insertion in model container [2024-06-03 19:02:18,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:02:18" (4/4) ... [2024-06-03 19:02:18,031 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-06-03 19:02:18,050 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 19:02:18,050 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 19:02:18,050 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 19:02:18,100 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-03 19:02:18,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 74 flow [2024-06-03 19:02:18,172 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-06-03 19:02:18,173 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-03 19:02:18,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 2/28 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/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-03 19:02:18,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 30 transitions, 74 flow [2024-06-03 19:02:18,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 61 flow [2024-06-03 19:02:18,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 19:02:18,204 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;@13b3330a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 19:02:18,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 19:02:18,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 19:02:18,210 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 19:02:18,211 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:02:18,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:02:18,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 19:02:18,212 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-03 19:02:18,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:02:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash -300262953, now seen corresponding path program 1 times [2024-06-03 19:02:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:02:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24952112] [2024-06-03 19:02:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:02:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:02:18,542 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-03 19:02:18,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:02:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24952112] [2024-06-03 19:02:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24952112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:02:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:02:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 19:02:18,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761801921] [2024-06-03 19:02:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:02:18,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 19:02:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:02:18,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 19:02:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 19:02:18,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 19:02:18,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-03 19:02:18,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:02:18,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 19:02:18,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:02:18,821 INFO L124 PetriNetUnfolderBase]: 267/482 cut-off events. [2024-06-03 19:02:18,821 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-03 19:02:18,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 482 events. 267/482 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1969 event pairs, 95 based on Foata normal form. 24/499 useless extension candidates. Maximal degree in co-relation 895. Up to 308 conditions per place. [2024-06-03 19:02:18,827 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2024-06-03 19:02:18,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 169 flow [2024-06-03 19:02:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 19:02:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 19:02:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-03 19:02:18,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-03 19:02:18,842 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 61 flow. Second operand 3 states and 54 transitions. [2024-06-03 19:02:18,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 169 flow [2024-06-03 19:02:18,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 19:02:18,850 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 67 flow [2024-06-03 19:02:18,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2024-06-03 19:02:18,855 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-06-03 19:02:18,855 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 67 flow [2024-06-03 19:02:18,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-03 19:02:18,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:02:18,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:02:18,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 19:02:18,857 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-03 19:02:18,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:02:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1606586641, now seen corresponding path program 1 times [2024-06-03 19:02:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:02:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287500945] [2024-06-03 19:02:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:02:18,886 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 19:02:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124384080] [2024-06-03 19:02:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:18,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:02:18,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:02:18,889 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-03 19:02:18,919 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-03 19:02:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:02:19,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-03 19:02:19,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:02:19,215 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-03 19:02:19,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 19:02:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:02:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287500945] [2024-06-03 19:02:19,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 19:02:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124384080] [2024-06-03 19:02:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124384080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:02:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:02:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 19:02:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67025798] [2024-06-03 19:02:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:02:19,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 19:02:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:02:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 19:02:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 19:02:19,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 19:02:19,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03 19:02:19,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:02:19,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 19:02:19,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:02:19,380 INFO L124 PetriNetUnfolderBase]: 339/609 cut-off events. [2024-06-03 19:02:19,381 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-06-03 19:02:19,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 609 events. 339/609 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2424 event pairs, 98 based on Foata normal form. 50/658 useless extension candidates. Maximal degree in co-relation 701. Up to 296 conditions per place. [2024-06-03 19:02:19,385 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2024-06-03 19:02:19,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 223 flow [2024-06-03 19:02:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 19:02:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 19:02:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-03 19:02:19,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-03 19:02:19,387 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 67 flow. Second operand 4 states and 74 transitions. [2024-06-03 19:02:19,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 223 flow [2024-06-03 19:02:19,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 19:02:19,389 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 99 flow [2024-06-03 19:02:19,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-03 19:02:19,390 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-03 19:02:19,390 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 99 flow [2024-06-03 19:02:19,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03 19:02:19,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:02:19,391 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:02:19,410 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-03 19:02:19,610 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-03 19:02:19,610 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-03 19:02:19,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:02:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash 972635647, now seen corresponding path program 1 times [2024-06-03 19:02:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:02:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793023494] [2024-06-03 19:02:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:02:19,639 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 19:02:19,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889465042] [2024-06-03 19:02:19,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:02:19,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:02:19,651 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-03 19:02:19,657 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-03 19:02:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:02:19,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-03 19:02:19,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:02:19,927 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-03 19:02:20,010 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-03 19:02:20,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 19:02:21,208 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-03 19:02:21,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:02:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793023494] [2024-06-03 19:02:21,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 19:02:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889465042] [2024-06-03 19:02:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889465042] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 19:02:21,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 19:02:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-06-03 19:02:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776921662] [2024-06-03 19:02:21,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 19:02:21,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:02:21,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:02:21,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:02:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:02:21,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 19:02:21,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 99 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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-03 19:02:21,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:02:21,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 19:02:21,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:02:22,038 INFO L124 PetriNetUnfolderBase]: 945/1730 cut-off events. [2024-06-03 19:02:22,038 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2024-06-03 19:02:22,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4015 conditions, 1730 events. 945/1730 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8274 event pairs, 60 based on Foata normal form. 199/1929 useless extension candidates. Maximal degree in co-relation 3669. Up to 279 conditions per place. [2024-06-03 19:02:22,047 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 123 selfloop transitions, 26 changer transitions 20/172 dead transitions. [2024-06-03 19:02:22,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 172 transitions, 797 flow [2024-06-03 19:02:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-03 19:02:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-03 19:02:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 259 transitions. [2024-06-03 19:02:22,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5755555555555556 [2024-06-03 19:02:22,051 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 99 flow. Second operand 15 states and 259 transitions. [2024-06-03 19:02:22,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 172 transitions, 797 flow [2024-06-03 19:02:22,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 172 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 19:02:22,055 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 339 flow [2024-06-03 19:02:22,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=339, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-06-03 19:02:22,056 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-03 19:02:22,056 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 339 flow [2024-06-03 19:02:22,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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-03 19:02:22,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:02:22,057 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-03 19:02:22,075 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-03 19:02:22,272 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-03 19:02:22,272 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-03 19:02:22,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:02:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 677794535, now seen corresponding path program 1 times [2024-06-03 19:02:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:02:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296736997] [2024-06-03 19:02:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:02:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:02:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:02:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296736997] [2024-06-03 19:02:22,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-06-03 19:02:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836222385] [2024-06-03 19:02:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:02:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:02:22,339 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-03 19:02:22,340 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-03 19:02:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:02:22,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-03 19:02:22,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:02:22,473 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-03 19:02:22,481 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-03 19:02:22,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 19:02:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836222385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:02:22,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:02:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 19:02:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914515815] [2024-06-03 19:02:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:02:22,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 19:02:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:02:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 19:02:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 19:02:22,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 19:02:22,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-03 19:02:22,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:02:22,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 19:02:22,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:02:22,678 INFO L124 PetriNetUnfolderBase]: 589/1154 cut-off events. [2024-06-03 19:02:22,678 INFO L125 PetriNetUnfolderBase]: For 2252/2275 co-relation queries the response was YES. [2024-06-03 19:02:22,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1154 events. 589/1154 cut-off events. For 2252/2275 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5164 event pairs, 195 based on Foata normal form. 73/1217 useless extension candidates. Maximal degree in co-relation 3228. Up to 563 conditions per place. [2024-06-03 19:02:22,686 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 66 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-06-03 19:02:22,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 594 flow [2024-06-03 19:02:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 19:02:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 19:02:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-03 19:02:22,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-03 19:02:22,688 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 339 flow. Second operand 3 states and 53 transitions. [2024-06-03 19:02:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 594 flow [2024-06-03 19:02:22,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 544 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-03 19:02:22,701 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 310 flow [2024-06-03 19:02:22,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-06-03 19:02:22,702 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-03 19:02:22,702 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 310 flow [2024-06-03 19:02:22,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-03 19:02:22,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:02:22,703 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:02:22,724 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-03 19:02:22,912 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-03 19:02:22,912 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-03 19:02:22,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:02:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1566985114, now seen corresponding path program 1 times [2024-06-03 19:02:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:02:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101583573] [2024-06-03 19:02:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:02:22,932 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 19:02:22,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997502967] [2024-06-03 19:02:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:02:22,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:02:22,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:02:22,934 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-03 19:02:22,936 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-03 19:02:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:02:23,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-03 19:02:23,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:02:23,190 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-03 19:02:23,194 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-03 19:02:23,202 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-03 19:02:24,896 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-03 19:02:24,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 19:02:27,433 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-03 19:02:27,444 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-03 19:02:29,625 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-03 19:02:29,636 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-03 19:02:31,504 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#ghost~multithreaded| 0) (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse1 (and (<= 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse2 (< .cse0 (+ .cse7 1))) (.cse5 (< c_~buffer_size~0 1)) (.cse4 (= (mod c_~send~0 256) 0)) (.cse3 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (< (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 1) .cse1 .cse2 .cse3 .cse4 (< (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse5) (or (let ((.cse6 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse0 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse6 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse0 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse6 (+ |~#buffer~0.offset| v_z_9))))))))) .cse1 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) (or .cse2 .cse5)) (not .cse4) (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse3 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (< .cse7 1))))) (< 6 c_~value~0) (< c_~value~0 0)) is different from false [2024-06-03 19:02:31,820 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-03 19:02:31,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-03 19:02:31,914 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 150 treesize of output 151 [2024-06-03 19:02:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-06-03 19:02:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:02:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101583573] [2024-06-03 19:02:32,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 19:02:32,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997502967] [2024-06-03 19:02:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997502967] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 19:02:32,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 19:02:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2024-06-03 19:02:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990849368] [2024-06-03 19:02:32,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 19:02:32,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-03 19:02:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:02:32,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-03 19:02:32,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=284, Unknown=1, NotChecked=36, Total=420 [2024-06-03 19:02:32,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 19:02:32,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 310 flow. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 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-03 19:02:32,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:02:32,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 19:02:32,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:02:32,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~buffer_size~0 4294967296)) (.cse36 (mod c_~next~0 4294967296))) (let ((.cse19 (< .cse34 (+ .cse36 1))) (.cse21 (< c_~buffer_size~0 1)) (.cse7 (<= 0 c_~value~0)) (.cse2 (= (mod c_~send~0 256) 0))) (let ((.cse3 (not .cse2)) (.cse6 (and (<= c_~value~0 6) .cse7)) (.cse22 (or .cse19 .cse21)) (.cse33 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse13 (= (mod c_~receive~0 256) 0))) (let ((.cse27 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (not .cse13)) (.cse10 (and .cse22 (not (= .cse33 0)))) (.cse11 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse14 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse16 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (or .cse3 .cse6)) (.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (and (<= 0 .cse30) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse4 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse5 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse9 (and (or .cse10 .cse11 .cse2 .cse14 .cse16) .cse32)) (.cse24 (or .cse8 .cse3 .cse6)) (.cse23 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse18 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse34) 1)) (.cse25 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< (+ c_~value~0 2147483648) 0)) (.cse15 (< 2147483647 c_~value~0)) (.cse26 (and (not (= .cse29 0)) .cse22)) (.cse17 (and (or (let ((.cse35 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse35 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse36 1)) (not (= (+ c_~value~0 1) 0)))) (.cse28 (and (<= 0 .cse33) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse20 (< .cse27 0)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 .cse1 (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (< 6 c_~value~0) (< c_~value~0 0))) .cse4 .cse5) (or .cse0 .cse6) .cse7 (or .cse0 (and (or .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (or .cse0 (and (or .cse18 .cse1 .cse19 .cse4 .cse2 .cse20 .cse21) (or .cse3 (and (or .cse8 .cse6) (or .cse12 .cse1 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) .cse22) .cse23 .cse4 .cse15 .cse5 .cse17))))) (or (and .cse24 (or .cse25 (and (or .cse12 .cse3 .cse23 .cse15 .cse26 .cse17) (or .cse18 (= .cse27 0) .cse19 .cse2 .cse21)) .cse28 .cse20)) .cse0) (or .cse0 .cse9) (or (and .cse24 (let ((.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse29)) (and (or .cse12 .cse3 .cse23 (and .cse22 (not (= .cse30 0))) .cse15 .cse17) (or .cse18 .cse19 .cse2 (= .cse31 0) .cse21)) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (< .cse31 0)))) .cse0) (= c_~send~0 1) (or (and (or .cse8 (and (or .cse25 .cse2 .cse26 .cse28 .cse20) .cse32)) (or .cse25 .cse12 .cse13 .cse15 .cse26 .cse17 .cse28 .cse20)) .cse0))))))) is different from false [2024-06-03 19:02:33,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~buffer_size~0 4294967296)) (.cse36 (mod c_~next~0 4294967296))) (let ((.cse19 (< .cse34 (+ .cse36 1))) (.cse21 (< c_~buffer_size~0 1)) (.cse7 (<= 0 c_~value~0)) (.cse2 (= (mod c_~send~0 256) 0))) (let ((.cse3 (not .cse2)) (.cse6 (and (<= c_~value~0 6) .cse7)) (.cse22 (or .cse19 .cse21)) (.cse33 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse13 (= (mod c_~receive~0 256) 0))) (let ((.cse27 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (not .cse13)) (.cse10 (and .cse22 (not (= .cse33 0)))) (.cse11 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse14 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse16 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (or .cse3 .cse6)) (.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (and (<= 0 .cse30) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse4 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse5 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse9 (and (or .cse10 .cse11 .cse2 .cse14 .cse16) .cse32)) (.cse24 (or .cse8 .cse3 .cse6)) (.cse23 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse18 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse34) 1)) (.cse25 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< (+ c_~value~0 2147483648) 0)) (.cse15 (< 2147483647 c_~value~0)) (.cse26 (and (not (= .cse29 0)) .cse22)) (.cse17 (and (or (let ((.cse35 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse35 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse36 1)) (not (= (+ c_~value~0 1) 0)))) (.cse28 (and (<= 0 .cse33) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse20 (< .cse27 0)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 .cse1 (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (< 6 c_~value~0) (< c_~value~0 0))) .cse4 .cse5) (or .cse0 .cse6) .cse7 (or .cse0 (and (or .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (or .cse0 (and (or .cse18 .cse1 .cse19 .cse4 .cse2 .cse20 .cse21) (or .cse3 (and (or .cse8 .cse6) (or .cse12 .cse1 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) .cse22) .cse23 .cse4 .cse15 .cse5 .cse17))))) (or (and .cse24 (or .cse25 (and (or .cse12 .cse3 .cse23 .cse15 .cse26 .cse17) (or .cse18 (= .cse27 0) .cse19 .cse2 .cse21)) .cse28 .cse20)) .cse0) (= |c_#ghost~multithreaded| 1) (or .cse0 .cse9) (or (and .cse24 (let ((.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse29)) (and (or .cse12 .cse3 .cse23 (and .cse22 (not (= .cse30 0))) .cse15 .cse17) (or .cse18 .cse19 .cse2 (= .cse31 0) .cse21)) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (< .cse31 0)))) .cse0) (= c_~send~0 1) (or (and (or .cse8 (and (or .cse25 .cse2 .cse26 .cse28 .cse20) .cse32)) (or .cse25 .cse12 .cse13 .cse15 .cse26 .cse17 .cse28 .cse20)) .cse0))))))) is different from false [2024-06-03 19:02:33,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (mod c_~buffer_size~0 4294967296)) (.cse22 (mod c_~next~0 4294967296))) (let ((.cse2 (= (mod c_~send~0 256) 0)) (.cse14 (< .cse20 (+ .cse22 1))) (.cse15 (< c_~buffer_size~0 1))) (let ((.cse16 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (< (+ c_~value~0 2147483648) 0)) (.cse7 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse10 (or .cse14 .cse15)) (.cse1 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse8 (< 2147483647 c_~value~0)) (.cse11 (and (or (let ((.cse21 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse20 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse21 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse20 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse22 1)) (not (= (+ c_~value~0 1) 0)))) (.cse4 (not (= (mod c_~receive~0 256) 0))) (.cse5 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse3 (not .cse2)) (.cse12 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse20) 1)) (.cse17 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse9 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (and (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3)) (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (< 6 c_~value~0) (< c_~value~0 0))) (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or (and (or .cse4 .cse3 .cse5) (let ((.cse13 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or .cse6 .cse3 .cse7 .cse8 (and (not (= .cse9 0)) .cse10) .cse11) (or .cse12 (= .cse13 0) .cse14 .cse2 .cse15)) (and (<= 0 .cse16) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5)) (< .cse13 0)))) .cse0) (or .cse0 (and (or (and .cse10 (not (= .cse16 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse2 .cse17 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 .cse5))) (or .cse0 (let ((.cse18 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse9))) (.cse19 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse18 .cse6 .cse7 (and .cse10 (not (= .cse1 0))) .cse8 .cse19 .cse11 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse4 .cse5)) .cse3) (or .cse12 .cse18 .cse14 .cse2 .cse17 .cse19 .cse15)))))))) is different from false [2024-06-03 19:02:39,804 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-03 19:02:42,266 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (mod c_~buffer_size~0 4294967296)) (.cse25 (mod c_~next~0 4294967296))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse10 (= (mod c_~receive~0 256) 0)) (.cse19 (< .cse23 (+ .cse25 1))) (.cse20 (< c_~buffer_size~0 1))) (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse15 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse13 (or .cse19 .cse20)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse24 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse23 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse24 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse23 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse25 1)) (not (= (+ c_~value~0 1) 0)))) (.cse2 (not .cse10)) (.cse1 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse8 (not .cse5)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse23) 1)) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse16 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 .cse1) (or .cse0 (let ((.cse3 (and .cse13 (not (= .cse14 0)))) (.cse4 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse7 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse2 (and (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1))) (or .cse3 .cse4 .cse9 .cse10 .cse6 .cse11 .cse7 .cse12)))) (or (and (or .cse2 .cse8 .cse1) (let ((.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or .cse9 .cse8 .cse15 .cse11 (and (not (= .cse16 0)) .cse13) .cse12) (or .cse17 (= .cse18 0) .cse19 .cse5 .cse20)) (and (<= 0 .cse14) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5)) (< .cse18 0)))) .cse0) (or .cse0 (let ((.cse21 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse16))) (.cse22 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse21 .cse9 .cse15 (and .cse13 (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 3) 0))) .cse11 .cse22 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse2 .cse1)) .cse8) (or .cse17 .cse21 .cse19 .cse5 .cse6 .cse22 .cse20)))))))) is different from false [2024-06-03 19:02:47,620 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (mod c_~buffer_size~0 4294967296)) (.cse19 (mod c_~next~0 4294967296))) (let ((.cse12 (= (mod c_~send~0 256) 0)) (.cse11 (< .cse17 (+ .cse19 1))) (.cse13 (< c_~buffer_size~0 1))) (let ((.cse14 (= |c_#ghost~multithreaded| 0)) (.cse3 (< (+ c_~value~0 2147483648) 0)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse7 (or .cse11 .cse13)) (.cse5 (< 2147483647 c_~value~0)) (.cse8 (and (or (let ((.cse18 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse17 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse18 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse17 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse19 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (not (= (mod c_~receive~0 256) 0))) (.cse2 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse1 (not .cse12)) (.cse9 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse17) 1)) (.cse6 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse0 .cse1 .cse2) (let ((.cse10 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or .cse3 .cse1 .cse4 .cse5 (and (not (= .cse6 0)) .cse7) .cse8) (or .cse9 (= .cse10 0) .cse11 .cse12 .cse13)) (and (<= 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5)) (< .cse10 0)))) .cse14) (or .cse14 (let ((.cse15 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse6))) (.cse16 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse15 .cse3 .cse4 (and .cse7 (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 3) 0))) .cse5 .cse16 .cse8 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse0 .cse2)) .cse1) (or .cse9 .cse15 .cse11 .cse12 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) .cse16 .cse13)))))))) is different from false [2024-06-03 19:02:52,960 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse26 (mod c_~next~0 4294967296))) (let ((.cse18 (< .cse24 (+ .cse26 1))) (.cse20 (< c_~buffer_size~0 1))) (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse15 (or .cse18 .cse20)) (.cse21 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse6 (= (mod c_~receive~0 256) 0)) (.cse3 (and .cse15 (not (= .cse21 0)))) (.cse4 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse7 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse9 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse11 (not .cse19)) (.cse12 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse2 (and (or .cse3 .cse4 .cse19 .cse7 .cse9) (or .cse11 .cse12))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse13 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse8 (< 2147483647 c_~value~0)) (.cse10 (and (or (let ((.cse25 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse24 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse25 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse24 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse26 1)) (not (= (+ c_~value~0 1) 0)))) (.cse1 (not .cse6)) (.cse16 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse14 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (or (and (or .cse1 .cse11 .cse12) (let ((.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or .cse5 .cse11 .cse13 .cse8 (and (not (= .cse14 0)) .cse15) .cse10) (or .cse16 (= .cse17 0) .cse18 .cse19 .cse20)) (and (<= 0 .cse21) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5)) (< .cse17 0)))) .cse0) (or .cse0 .cse2) (or .cse0 (let ((.cse22 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse14))) (.cse23 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse22 .cse5 .cse13 (and .cse15 (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 3) 0))) .cse8 .cse23 .cse10 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse1 .cse12)) .cse11) (or .cse16 .cse22 .cse18 .cse19 .cse7 .cse23 .cse20)))))))))) is different from false [2024-06-03 19:02:54,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296))) (let ((.cse12 (= (mod c_~send~0 256) 0)) (.cse11 (< .cse19 (+ .cse21 1))) (.cse13 (< c_~buffer_size~0 1))) (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse15 (= |c_#ghost~multithreaded| 0)) (.cse3 (< (+ c_~value~0 2147483648) 0)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse7 (or .cse11 .cse13)) (.cse5 (< 2147483647 c_~value~0)) (.cse8 (and (or (let ((.cse20 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse19 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse20 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse19 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse20 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse21 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (not (= (mod c_~receive~0 256) 0))) (.cse2 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse1 (not .cse12)) (.cse9 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse19) 1)) (.cse16 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse6 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse0 .cse1 .cse2) (let ((.cse10 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or .cse3 .cse1 .cse4 .cse5 (and (not (= .cse6 0)) .cse7) .cse8) (or .cse9 (= .cse10 0) .cse11 .cse12 .cse13)) (and (<= 0 .cse14) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5)) (< .cse10 0)))) .cse15) (or .cse15 (and (or (and .cse7 (not (= .cse14 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse12 .cse16 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse1 .cse2))) (or .cse15 (let ((.cse17 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse6))) (.cse18 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse17 .cse3 .cse4 (and .cse7 (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 3) 0))) .cse5 .cse18 .cse8 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse0 .cse2)) .cse1) (or .cse9 .cse17 .cse11 .cse12 .cse16 .cse18 .cse13)))))))) is different from false [2024-06-03 19:03:12,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod c_~buffer_size~0 4294967296)) (.cse40 (mod c_~next~0 4294967296))) (let ((.cse29 (< .cse39 (+ .cse40 1))) (.cse30 (< c_~buffer_size~0 1)) (.cse2 (= (mod c_~send~0 256) 0))) (let ((.cse28 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse35 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse3 (not .cse2)) (.cse23 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse34 (or .cse29 .cse30)) (.cse38 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse18 (= (mod c_~receive~0 256) 0))) (let ((.cse9 (let ((.cse41 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse39 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse41 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse39 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse41 (+ |~#buffer~0.offset| v_z_9)))))))))) (.cse12 (< .cse40 1)) (.cse33 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (not .cse18)) (.cse15 (and .cse34 (not (= .cse38 0)))) (.cse16 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse19 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse37 (or .cse3 .cse23)) (.cse27 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse39) 1)) (.cse1 (and (<= 0 .cse35) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse6 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (< .cse28 0))) (let ((.cse4 (< 6 c_~value~0)) (.cse5 (< c_~value~0 0)) (.cse8 (or .cse27 .cse1 .cse29 .cse6 .cse2 .cse32 .cse30)) (.cse10 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) .cse34)) (.cse7 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse14 (and (or .cse15 .cse16 .cse2 .cse19 .cse21) .cse37)) (.cse24 (or .cse13 .cse3 .cse23)) (.cse11 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse25 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (< (+ c_~value~0 2147483648) 0)) (.cse20 (< 2147483647 c_~value~0)) (.cse26 (and (not (= .cse33 0)) .cse34)) (.cse22 (and (or .cse9 .cse12) (not (= (+ c_~value~0 1) 0)))) (.cse31 (and (<= 0 .cse38) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 .cse1 (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 .cse4 .cse5)) .cse6 .cse7) (or .cse0 (and .cse8 (or .cse9 .cse1 .cse10 .cse3 .cse11 .cse6 .cse7 .cse12)) .cse4 .cse5) (or .cse0 (and (or .cse13 .cse14) (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) (or .cse0 (and .cse8 (or .cse3 (and (or .cse13 .cse23) (or .cse17 .cse1 .cse10 .cse11 .cse6 .cse20 .cse7 .cse22))))) (or (and .cse24 (or .cse25 (and (or .cse17 .cse3 .cse11 .cse20 .cse26 .cse22) (or .cse27 (= .cse28 0) .cse29 .cse2 .cse30)) .cse31 .cse32)) .cse0) (= |c_#ghost~multithreaded| 1) (or .cse0 .cse14) (or (and .cse24 (let ((.cse36 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse33)) (and (or .cse17 .cse3 .cse11 (and .cse34 (not (= .cse35 0))) .cse20 .cse22) (or .cse27 .cse29 .cse2 (= .cse36 0) .cse30)) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (< .cse36 0)))) .cse0) (= c_~value~0 3) (or (and (or .cse13 (and (or .cse25 .cse2 .cse26 .cse31 .cse32) .cse37)) (or .cse25 .cse17 .cse18 .cse20 .cse26 .cse22 .cse31 .cse32)) .cse0))))))) is different from false [2024-06-03 19:03:21,709 INFO L124 PetriNetUnfolderBase]: 6310/11075 cut-off events. [2024-06-03 19:03:21,710 INFO L125 PetriNetUnfolderBase]: For 36252/36252 co-relation queries the response was YES. [2024-06-03 19:03:21,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33800 conditions, 11075 events. 6310/11075 cut-off events. For 36252/36252 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 72982 event pairs, 608 based on Foata normal form. 162/11236 useless extension candidates. Maximal degree in co-relation 30940. Up to 1592 conditions per place. [2024-06-03 19:03:21,778 INFO L140 encePairwiseOnDemand]: 12/30 looper letters, 403 selfloop transitions, 176 changer transitions 242/822 dead transitions. [2024-06-03 19:03:21,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 822 transitions, 5557 flow [2024-06-03 19:03:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-06-03 19:03:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2024-06-03 19:03:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 802 transitions. [2024-06-03 19:03:21,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311827956989247 [2024-06-03 19:03:21,786 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 310 flow. Second operand 62 states and 802 transitions. [2024-06-03 19:03:21,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 822 transitions, 5557 flow [2024-06-03 19:03:21,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 822 transitions, 5401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 19:03:21,849 INFO L231 Difference]: Finished difference. Result has 151 places, 235 transitions, 2202 flow [2024-06-03 19:03:21,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=2202, PETRI_PLACES=151, PETRI_TRANSITIONS=235} [2024-06-03 19:03:21,850 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-03 19:03:21,851 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 235 transitions, 2202 flow [2024-06-03 19:03:21,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 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-03 19:03:21,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:21,851 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, 1] [2024-06-03 19:03:21,865 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-03 19:03:22,056 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-03 19:03:22,056 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-03 19:03:22,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 415527323, now seen corresponding path program 1 times [2024-06-03 19:03:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730041653] [2024-06-03 19:03:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:22,082 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 19:03:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488064775] [2024-06-03 19:03:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:03:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:03:22,087 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-03 19:03:22,089 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-03 19:03:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:22,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-03 19:03:22,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:03:22,307 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-03 19:03:22,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-03 19:03:22,351 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-03 19:03:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:24,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 19:03:27,374 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-03 19:03:27,437 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-03 19:03:28,644 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-03 19:03:28,770 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-03 19:03:28,778 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-03 19:03:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730041653] [2024-06-03 19:03:29,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 19:03:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488064775] [2024-06-03 19:03:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488064775] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 19:03:29,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 19:03:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2024-06-03 19:03:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613879321] [2024-06-03 19:03:29,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 19:03:29,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-03 19:03:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-03 19:03:29,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-06-03 19:03:29,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 19:03:29,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 235 transitions, 2202 flow. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 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-03 19:03:29,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:29,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 19:03:29,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:41,954 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-03 19:04:00,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 19:04:01,480 INFO L124 PetriNetUnfolderBase]: 6877/12884 cut-off events. [2024-06-03 19:04:01,480 INFO L125 PetriNetUnfolderBase]: For 375569/375961 co-relation queries the response was YES. [2024-06-03 19:04:01,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99437 conditions, 12884 events. 6877/12884 cut-off events. For 375569/375961 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 95542 event pairs, 1377 based on Foata normal form. 339/13127 useless extension candidates. Maximal degree in co-relation 98764. Up to 8627 conditions per place. [2024-06-03 19:04:01,641 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 355 selfloop transitions, 274 changer transitions 109/743 dead transitions. [2024-06-03 19:04:01,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 743 transitions, 10548 flow [2024-06-03 19:04:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-06-03 19:04:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-06-03 19:04:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 572 transitions. [2024-06-03 19:04:01,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46504065040650405 [2024-06-03 19:04:01,651 INFO L175 Difference]: Start difference. First operand has 151 places, 235 transitions, 2202 flow. Second operand 41 states and 572 transitions. [2024-06-03 19:04:01,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 743 transitions, 10548 flow [2024-06-03 19:04:02,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 743 transitions, 9984 flow, removed 276 selfloop flow, removed 7 redundant places. [2024-06-03 19:04:02,258 INFO L231 Difference]: Finished difference. Result has 196 places, 407 transitions, 5132 flow [2024-06-03 19:04:02,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=5132, PETRI_PLACES=196, PETRI_TRANSITIONS=407} [2024-06-03 19:04:02,259 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 165 predicate places. [2024-06-03 19:04:02,259 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 407 transitions, 5132 flow [2024-06-03 19:04:02,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 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-03 19:04:02,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:02,260 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:02,275 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-03 19:04:02,464 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-03 19:04:02,464 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-03 19:04:02,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash 577127480, now seen corresponding path program 2 times [2024-06-03 19:04:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:02,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182260253] [2024-06-03 19:04:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:02,492 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 19:04:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624397458] [2024-06-03 19:04:02,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-03 19:04:02,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:04:02,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:04:02,498 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-03 19:04:02,499 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-03 19:04:02,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-03 19:04:02,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-03 19:04:02,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-03 19:04:02,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:04:02,765 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-03 19:04:02,770 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-03 19:04:02,774 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-03 19:04:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:04,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 19:04:05,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 4 [2024-06-03 19:04:05,622 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-03 19:04:07,431 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-03 19:04:07,588 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#ghost~multithreaded| 0) (let ((.cse4 (= (mod c_~send~0 256) 0))) (let ((.cse0 (not .cse4))) (and (or (not (= (mod c_~receive~0 256) 0)) .cse0 (and (<= c_~value~0 6) (<= 0 c_~value~0)) (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (let ((.cse1 (mod c_~buffer_size~0 4294967296)) (.cse3 (mod c_~next~0 4294967296))) (and (or (< (+ c_~value~0 2147483648) 0) .cse0 (= (* 256 (div c_~receive~0 256)) c_~receive~0) (< 2147483647 c_~value~0) (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse2 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse1 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse2 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse1 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse2 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse3 1)))) (or (< (mod (mod (+ c_~next~0 1) 4294967296) .cse1) 1) (< .cse1 (+ .cse3 1)) .cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) (< c_~buffer_size~0 1))))))))) is different from false [2024-06-03 19:04:08,041 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#ghost~multithreaded| 0) (let ((.cse3 (= (mod c_~send~0 256) 0))) (let ((.cse4 (not .cse3)) (.cse2 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse0 (mod c_~buffer_size~0 4294967296)) (.cse1 (mod c_~next~0 4294967296))) (and (or (< (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 1) (< .cse0 (+ .cse1 1)) .cse2 .cse3 (< c_~buffer_size~0 1)) (or (not (= (mod c_~receive~0 256) 0)) (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse4 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (or (< (+ c_~value~0 2147483648) 0) .cse4 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) (< 2147483647 c_~value~0) (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse5 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse0 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse5 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse0 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse5 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse1 1)))))))) is different from false [2024-06-03 19:04:08,392 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-03 19:04:08,432 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-03 19:04:08,442 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-03 19:04:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-06-03 19:04:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182260253] [2024-06-03 19:04:08,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 19:04:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624397458] [2024-06-03 19:04:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624397458] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 19:04:08,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 19:04:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2024-06-03 19:04:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438737115] [2024-06-03 19:04:08,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 19:04:08,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-03 19:04:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-03 19:04:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=330, Unknown=2, NotChecked=82, Total=552 [2024-06-03 19:04:08,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 19:04:08,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 407 transitions, 5132 flow. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 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-03 19:04:08,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:08,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 19:04:08,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:10,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (mod c_~buffer_size~0 4294967296)) (.cse25 (mod c_~next~0 4294967296))) (let ((.cse9 (= (mod c_~send~0 256) 0)) (.cse16 (< .cse23 (+ .cse25 1))) (.cse17 (< c_~buffer_size~0 1)) (.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (= (mod c_~receive~0 256) 0)) (.cse21 (and (or .cse16 .cse17) (not (= .cse26 0)))) (.cse10 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse22 (< 0 .cse26)) (.cse1 (not .cse9)) (.cse8 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse18 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse11 (and (or .cse21 .cse9 .cse10 .cse22) (or .cse1 .cse8))) (.cse12 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse15 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse23) 1)) (.cse6 (not .cse20)) (.cse7 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse5 (< 2147483647 c_~value~0)) (.cse14 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse24 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse23 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse23 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse25 1))))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8))) (or .cse3 .cse9 .cse10))) (or .cse0 .cse11 .cse12) (or (and (or .cse13 (and (or .cse2 .cse1 .cse4 .cse5 .cse14) (or .cse15 .cse16 .cse9 .cse10 .cse17))) (or .cse6 .cse1 .cse18 .cse8)) .cse0) (or .cse6 .cse1 .cse8) (or .cse0 (let ((.cse19 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse15 .cse19 .cse16 .cse9 .cse17) (or .cse19 .cse2 .cse1 .cse4 .cse5 .cse14)))) (or .cse0 (and (or .cse6 (and (or .cse9 .cse13) (or .cse1 .cse18 .cse8))) (or .cse2 .cse20 .cse5 .cse13 .cse14))) (or .cse0 (and (or .cse21 .cse2 .cse20 .cse10 .cse5 .cse22 .cse14) (or .cse6 .cse11)) .cse12) (or .cse0 (and (or .cse15 .cse16 .cse3 .cse9 .cse17) (or .cse6 .cse7 .cse1 .cse8) (or .cse2 .cse1 .cse3 .cse4 .cse5 .cse14)))))))) is different from false [2024-06-03 19:04:10,908 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (= (mod c_~send~0 256) 0)) (.cse14 (= (mod c_~receive~0 256) 0)) (.cse18 (mod c_~next~0 4294967296)) (.cse16 (mod c_~buffer_size~0 4294967296))) (let ((.cse0 (= |c_#ghost~multithreaded| 0)) (.cse4 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse16) 1)) (.cse6 (< .cse16 (+ .cse18 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse1 (not .cse14)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse2 (not .cse7)) (.cse10 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse17 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse16 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse16 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse18 1))))) (and (or .cse0 (let ((.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse5 .cse9 .cse2 .cse10 .cse11 .cse12)))) (or .cse0 (let ((.cse13 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse1 (and (or .cse7 .cse13) (or .cse2 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse3))) (or .cse9 .cse14 .cse11 .cse13 .cse12)))) (or .cse0 (let ((.cse15 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse4 .cse6 .cse15 .cse7 .cse8) (or .cse1 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3) (or .cse9 .cse2 .cse15 .cse10 .cse11 .cse12))))))) is different from false [2024-06-03 19:04:19,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse20 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296))) (let ((.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse12 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse13 (< .cse18 (+ .cse20 1))) (.cse14 (< c_~buffer_size~0 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (not .cse17)) (.cse1 (not .cse8)) (.cse15 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse10 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse11 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse19 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse20 1))))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or (and (or .cse10 (and (or .cse2 .cse1 .cse4 .cse5 .cse11) (or .cse12 .cse13 .cse8 .cse9 .cse14))) (or .cse6 .cse1 .cse15 .cse7)) .cse0) (or .cse0 (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse12 .cse16 .cse13 .cse8 .cse14) (or .cse16 .cse2 .cse1 .cse4 .cse5 .cse11)))) (or .cse0 (and (or .cse6 (and (or .cse8 .cse10) (or .cse1 .cse15 .cse7))) (or .cse2 .cse17 .cse5 .cse10 .cse11)))))) is different from false [2024-06-03 19:04:19,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (< .cse22 (+ .cse24 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (and (or .cse15 .cse16) (not (= .cse25 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse25)) (.cse1 (not .cse8)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse19 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse17 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse13 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse24 1)))) (.cse6 (not .cse19)) (.cse10 (and (or .cse20 .cse8 .cse9 .cse21) (or .cse1 .cse7))) (.cse11 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or .cse0 .cse10 .cse11) (or (and (or .cse12 (and (or .cse2 .cse1 .cse4 .cse5 .cse13) (or .cse14 .cse15 .cse8 .cse9 .cse16))) (or .cse6 .cse1 .cse17 .cse7)) .cse0) (or .cse6 .cse1 .cse7) (or .cse0 (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse14 .cse18 .cse15 .cse8 .cse16) (or .cse18 .cse2 .cse1 .cse4 .cse5 .cse13)))) (or .cse0 .cse7) (or .cse0 (and (or .cse6 (and (or .cse8 .cse12) (or .cse1 .cse17 .cse7))) (or .cse2 .cse19 .cse5 .cse12 .cse13))) (or .cse0 (and (or .cse20 .cse2 .cse19 .cse9 .cse5 .cse21 .cse13) (or .cse6 .cse10)) .cse11)))))) is different from false [2024-06-03 19:04:20,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (= (mod c_~receive~0 256) 0)) (.cse18 (mod c_~next~0 4294967296)) (.cse16 (mod c_~buffer_size~0 4294967296))) (let ((.cse6 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse16) 1)) (.cse7 (< .cse16 (+ .cse18 1))) (.cse9 (< c_~buffer_size~0 1)) (.cse3 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse13 (= |c_#ghost~multithreaded| 0)) (.cse10 (not .cse15)) (.cse2 (not .cse8)) (.cse11 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse1 (< (+ c_~value~0 2147483648) 0)) (.cse4 (< 2147483647 c_~value~0)) (.cse0 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse5 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse17 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse16 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse16 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse18 1))))) (and (or (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) .cse9))) (or .cse10 .cse2 .cse11 .cse12)) .cse13) (or .cse13 (let ((.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse10 .cse2 .cse12 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse6 .cse14 .cse7 .cse8 .cse9) (or .cse14 .cse1 .cse2 .cse3 .cse4 .cse5)))) (or .cse10 .cse13 .cse2 .cse12) (or .cse13 (and (or .cse10 (and (or .cse8 .cse0) (or .cse2 .cse11 .cse12))) (or .cse1 .cse15 .cse4 .cse0 .cse5)))))) is different from false [2024-06-03 19:04:20,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (= (mod c_~receive~0 256) 0)) (.cse18 (mod c_~next~0 4294967296)) (.cse16 (mod c_~buffer_size~0 4294967296))) (let ((.cse6 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse16) 1)) (.cse7 (< .cse16 (+ .cse18 1))) (.cse9 (< c_~buffer_size~0 1)) (.cse3 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse13 (= |c_#ghost~multithreaded| 0)) (.cse10 (not .cse15)) (.cse2 (not .cse8)) (.cse11 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse1 (< (+ c_~value~0 2147483648) 0)) (.cse4 (< 2147483647 c_~value~0)) (.cse0 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse5 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse17 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse16 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse16 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse18 1))))) (and (or (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0) .cse9))) (or .cse10 .cse2 .cse11 .cse12)) .cse13) (or .cse10 .cse2 .cse12) (or .cse13 (let ((.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse10 .cse2 .cse12 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse6 .cse14 .cse7 .cse8 .cse9) (or .cse14 .cse1 .cse2 .cse3 .cse4 .cse5)))) (or .cse13 (and (or .cse10 (and (or .cse8 .cse0) (or .cse2 .cse11 .cse12))) (or .cse1 .cse15 .cse4 .cse0 .cse5)))))) is different from false [2024-06-03 19:04:21,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (< .cse22 (+ .cse24 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (and (or .cse15 .cse16) (not (= .cse25 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse25)) (.cse1 (not .cse8)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse19 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse17 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse13 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse24 1)))) (.cse6 (not .cse19)) (.cse10 (and (or .cse20 .cse8 .cse9 .cse21) (or .cse1 .cse7))) (.cse11 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or .cse0 .cse10 .cse11) (or (and (or .cse12 (and (or .cse2 .cse1 .cse4 .cse5 .cse13) (or .cse14 .cse15 .cse8 .cse9 .cse16))) (or .cse6 .cse1 .cse17 .cse7)) .cse0) (or .cse0 (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse14 .cse18 .cse15 .cse8 .cse16) (or .cse18 .cse2 .cse1 .cse4 .cse5 .cse13)))) (or .cse0 (and (or .cse6 (and (or .cse8 .cse12) (or .cse1 .cse17 .cse7))) (or .cse2 .cse19 .cse5 .cse12 .cse13))) (or .cse0 (and (or .cse20 .cse2 .cse19 .cse9 .cse5 .cse21 .cse13) (or .cse6 .cse10)) .cse11)))))) is different from false [2024-06-03 19:04:21,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~buffer_size~0 4294967296)) (.cse6 (mod c_~next~0 4294967296)) (.cse7 (= (mod c_~send~0 256) 0)) (.cse12 (= (mod c_~receive~0 256) 0))) (let ((.cse0 (= |c_#ghost~multithreaded| 0)) (.cse1 (not .cse12)) (.cse2 (not .cse7)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse8 (< (+ c_~value~0 2147483648) 0)) (.cse9 (< 2147483647 c_~value~0)) (.cse10 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse4 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse4 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse6 1))))) (and (or .cse0 (let ((.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or (< (mod (mod (+ c_~next~0 1) 4294967296) .cse4) 1) .cse5 (< .cse4 (+ .cse6 1)) .cse7 (< c_~buffer_size~0 1)) (or .cse5 .cse8 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse9 .cse10)))) (or .cse0 (let ((.cse11 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse1 (and (or .cse7 .cse11) (or .cse2 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse3))) (or .cse8 .cse12 .cse9 .cse11 .cse10))))))) is different from false [2024-06-03 19:04:22,339 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (< .cse22 (+ .cse24 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (and (or .cse15 .cse16) (not (= .cse25 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse25)) (.cse1 (not .cse8)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse19 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse17 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse13 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse24 1)))) (.cse6 (not .cse19)) (.cse10 (and (or .cse20 .cse8 .cse9 .cse21) (or .cse1 .cse7))) (.cse11 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or .cse0 .cse10 .cse11) (or (and (or .cse12 (and (or .cse2 .cse1 .cse4 .cse5 .cse13) (or .cse14 .cse15 .cse8 .cse9 .cse16))) (or .cse6 .cse1 .cse17 .cse7)) .cse0) (or .cse0 (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse14 .cse18 .cse15 .cse8 .cse16) (or .cse18 .cse2 .cse1 .cse4 .cse5 .cse13)))) (or .cse6 .cse0 .cse1 .cse7) (or .cse0 (and (or .cse6 (and (or .cse8 .cse12) (or .cse1 .cse17 .cse7))) (or .cse2 .cse19 .cse5 .cse12 .cse13))) (or .cse0 (and (or .cse20 .cse2 .cse19 .cse9 .cse5 .cse21 .cse13) (or .cse6 .cse10)) .cse11)))))) is different from false [2024-06-03 19:04:23,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse11 (= (mod c_~send~0 256) 0)) (.cse10 (< .cse21 (+ .cse23 1))) (.cse13 (< c_~buffer_size~0 1)) (.cse24 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse19 (and (or .cse10 .cse13) (not (= .cse24 0)))) (.cse12 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse20 (< 0 .cse24)) (.cse5 (not .cse11)) (.cse16 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse18 (= (mod c_~receive~0 256) 0))) (let ((.cse9 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse21) 1)) (.cse6 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse4 (< (+ c_~value~0 2147483648) 0)) (.cse7 (< 2147483647 c_~value~0)) (.cse8 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse22 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse21 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse21 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse23 1)))) (.cse14 (not .cse18)) (.cse1 (and (or .cse19 .cse11 .cse12 .cse20) (or .cse5 .cse16))) (.cse2 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 .cse1 .cse2) (or (and (or .cse3 (and (or .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13))) (or .cse14 .cse5 .cse15 .cse16)) .cse0) (or .cse0 (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse14 .cse5 .cse16 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse9 .cse17 .cse10 .cse11 .cse13) (or .cse17 .cse4 .cse5 .cse6 .cse7 .cse8)))) (or .cse14 .cse0 .cse5 .cse16) (or .cse0 (and (or .cse14 (and (or .cse11 .cse3) (or .cse5 .cse15 .cse16))) (or .cse4 .cse18 .cse7 .cse3 .cse8))) (or .cse0 (and (or .cse19 .cse4 .cse18 .cse12 .cse7 .cse20 .cse8) (or .cse14 .cse1)) .cse2)))))) is different from false [2024-06-03 19:04:28,562 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-03 19:04:35,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (< .cse22 (+ .cse24 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (and (or .cse15 .cse16) (not (= .cse25 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse25)) (.cse1 (not .cse8)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse19 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse17 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse13 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse24 1)))) (.cse6 (not .cse19)) (.cse10 (and (or .cse20 .cse8 .cse9 .cse21) (or .cse1 .cse7))) (.cse11 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or .cse0 .cse10 .cse11) (or (and (or .cse12 (and (or .cse2 .cse1 .cse4 .cse5 .cse13) (or .cse14 .cse15 .cse8 .cse9 .cse16))) (or .cse6 .cse1 .cse17 .cse7)) .cse0) (or .cse0 (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse14 .cse18 .cse15 .cse8 .cse16) (or .cse18 .cse2 .cse1 .cse4 .cse5 .cse13)))) (or .cse0 .cse7) (or .cse0 (and (or .cse6 (and (or .cse8 .cse12) (or .cse1 .cse17 .cse7))) (or .cse2 .cse19 .cse5 .cse12 .cse13))) (or .cse0 (and (or .cse20 .cse2 .cse19 .cse9 .cse5 .cse21 .cse13) (or .cse6 .cse10)) .cse11)))))) is different from false [2024-06-03 19:04:35,612 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (mod c_~buffer_size~0 4294967296)) (.cse25 (mod c_~next~0 4294967296))) (let ((.cse10 (<= c_~value~0 6)) (.cse8 (= (mod c_~send~0 256) 0)) (.cse16 (< .cse23 (+ .cse25 1))) (.cse17 (< c_~buffer_size~0 1)) (.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse21 (and (or .cse16 .cse17) (not (= .cse26 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse22 (< 0 .cse26)) (.cse1 (not .cse8)) (.cse7 (and .cse10 (<= 0 c_~value~0))) (.cse20 (= (mod c_~receive~0 256) 0))) (let ((.cse15 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse23) 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse18 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse14 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse24 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse23 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse23 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse25 1)))) (.cse6 (not .cse20)) (.cse11 (and (or .cse21 .cse8 .cse9 .cse22) (or .cse1 .cse7))) (.cse12 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) .cse10 (or .cse0 .cse11 .cse12) (or (and (or .cse13 (and (or .cse2 .cse1 .cse4 .cse5 .cse14) (or .cse15 .cse16 .cse8 .cse9 .cse17))) (or .cse6 .cse1 .cse18 .cse7)) .cse0) (<= 3 c_~value~0) (or .cse0 (let ((.cse19 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse15 .cse19 .cse16 .cse8 .cse17) (or .cse19 .cse2 .cse1 .cse4 .cse5 .cse14)))) (= |c_#ghost~multithreaded| 1) (or .cse0 (and (or .cse6 (and (or .cse8 .cse13) (or .cse1 .cse18 .cse7))) (or .cse2 .cse20 .cse5 .cse13 .cse14))) (or .cse0 (and (or .cse21 .cse2 .cse20 .cse9 .cse5 .cse22 .cse14) (or .cse6 .cse11)) .cse12)))))) is different from false [2024-06-03 19:04:36,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse20 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296))) (let ((.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse12 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse13 (< .cse18 (+ .cse20 1))) (.cse14 (< c_~buffer_size~0 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (not .cse17)) (.cse1 (not .cse8)) (.cse15 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse10 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse11 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse19 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse20 1))))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or (and (or .cse10 (and (or .cse2 .cse1 .cse4 .cse5 .cse11) (or .cse12 .cse13 .cse8 .cse9 .cse14))) (or .cse6 .cse1 .cse15 .cse7)) .cse0) (or .cse0 (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse12 .cse16 .cse13 .cse8 .cse14) (or .cse16 .cse2 .cse1 .cse4 .cse5 .cse11)))) (or .cse0 .cse7) (or .cse0 (and (or .cse6 (and (or .cse8 .cse10) (or .cse1 .cse15 .cse7))) (or .cse2 .cse17 .cse5 .cse10 .cse11)))))) is different from false [2024-06-03 19:04:38,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse15 (< .cse22 (+ .cse24 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (and (or .cse15 .cse16) (not (= .cse25 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse25)) (.cse1 (not .cse8)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse19 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse17 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse13 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse22 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse24 1)))) (.cse6 (not .cse19)) (.cse10 (and (or .cse20 .cse8 .cse9 .cse21) (or .cse1 .cse7))) (.cse11 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or .cse0 .cse10 .cse11) (or (and (or .cse12 (and (or .cse2 .cse1 .cse4 .cse5 .cse13) (or .cse14 .cse15 .cse8 .cse9 .cse16))) (or .cse6 .cse1 .cse17 .cse7)) .cse0) (or .cse6 .cse1 .cse7) (or .cse0 (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse14 .cse18 .cse15 .cse8 .cse16) (or .cse18 .cse2 .cse1 .cse4 .cse5 .cse13)))) (or .cse0 (and (or .cse6 (and (or .cse8 .cse12) (or .cse1 .cse17 .cse7))) (or .cse2 .cse19 .cse5 .cse12 .cse13))) (or .cse0 (and (or .cse20 .cse2 .cse19 .cse9 .cse5 .cse21 .cse13) (or .cse6 .cse10)) .cse11)))))) is different from false [2024-06-03 19:04:38,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse20 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296))) (let ((.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse12 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse13 (< .cse18 (+ .cse20 1))) (.cse14 (< c_~buffer_size~0 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (not .cse17)) (.cse1 (not .cse8)) (.cse15 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse10 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse11 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse19 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse20 1))))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or (and (or .cse10 (and (or .cse2 .cse1 .cse4 .cse5 .cse11) (or .cse12 .cse13 .cse8 .cse9 .cse14))) (or .cse6 .cse1 .cse15 .cse7)) .cse0) (or .cse0 (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse12 .cse16 .cse13 .cse8 .cse14) (or .cse16 .cse2 .cse1 .cse4 .cse5 .cse11)))) (or .cse6 .cse0 .cse1 .cse7) (or .cse0 (and (or .cse6 (and (or .cse8 .cse10) (or .cse1 .cse15 .cse7))) (or .cse2 .cse17 .cse5 .cse10 .cse11)))))) is different from false [2024-06-03 19:04:38,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse20 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296))) (let ((.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse12 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse13 (< .cse18 (+ .cse20 1))) (.cse14 (< c_~buffer_size~0 1)) (.cse4 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (not .cse17)) (.cse1 (not .cse8)) (.cse15 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 2147483647 c_~value~0)) (.cse10 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse11 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse19 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse18 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse19 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse20 1))))) (and (or .cse0 (let ((.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5) (or .cse6 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7))) (or .cse3 .cse8 .cse9)))) (or (and (or .cse10 (and (or .cse2 .cse1 .cse4 .cse5 .cse11) (or .cse12 .cse13 .cse8 .cse9 .cse14))) (or .cse6 .cse1 .cse15 .cse7)) .cse0) (or .cse6 .cse1 .cse7) (or .cse0 (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse1 .cse7 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse12 .cse16 .cse13 .cse8 .cse14) (or .cse16 .cse2 .cse1 .cse4 .cse5 .cse11)))) (or .cse0 (and (or .cse6 (and (or .cse8 .cse10) (or .cse1 .cse15 .cse7))) (or .cse2 .cse17 .cse5 .cse10 .cse11)))))) is different from false [2024-06-03 19:04:42,917 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-03 19:04:53,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse11 (= (mod c_~send~0 256) 0)) (.cse10 (< .cse21 (+ .cse23 1))) (.cse13 (< c_~buffer_size~0 1)) (.cse24 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse19 (and (or .cse10 .cse13) (not (= .cse24 0)))) (.cse12 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse20 (< 0 .cse24)) (.cse5 (not .cse11)) (.cse16 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse18 (= (mod c_~receive~0 256) 0))) (let ((.cse9 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse21) 1)) (.cse6 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse4 (< (+ c_~value~0 2147483648) 0)) (.cse7 (< 2147483647 c_~value~0)) (.cse8 (and (not (= (+ c_~value~0 1) 0)) (or (let ((.cse22 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_52 Int)) (or (< .cse21 (+ v_z_52 1)) (< 2147483647 v_z_52) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_52))))) (< v_z_52 0))) (forall ((v_z_52 Int)) (or (< .cse21 (+ v_z_52 1)) (< v_z_52 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_52 (- 4294967296)))))))))) (< .cse23 1)))) (.cse14 (not .cse18)) (.cse1 (and (or .cse19 .cse11 .cse12 .cse20) (or .cse5 .cse16))) (.cse2 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 .cse1 .cse2) (or (and (or .cse3 (and (or .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13))) (or .cse14 .cse5 .cse15 .cse16)) .cse0) (or .cse0 (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse14 .cse5 .cse16 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse9 .cse17 .cse10 .cse11 .cse13) (or .cse17 .cse4 .cse5 .cse6 .cse7 .cse8)))) (or .cse0 (and (or .cse14 (and (or .cse11 .cse3) (or .cse5 .cse15 .cse16))) (or .cse4 .cse18 .cse7 .cse3 .cse8))) (or .cse0 (and (or .cse19 .cse4 .cse18 .cse12 .cse7 .cse20 .cse8) (or .cse14 .cse1)) .cse2)))))) is different from false [2024-06-03 19:05:09,094 INFO L124 PetriNetUnfolderBase]: 22925/43631 cut-off events. [2024-06-03 19:05:09,094 INFO L125 PetriNetUnfolderBase]: For 2107182/2107212 co-relation queries the response was YES. [2024-06-03 19:05:09,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380591 conditions, 43631 events. 22925/43631 cut-off events. For 2107182/2107212 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 399233 event pairs, 3339 based on Foata normal form. 668/44296 useless extension candidates. Maximal degree in co-relation 379188. Up to 29476 conditions per place. [2024-06-03 19:05:09,886 INFO L140 encePairwiseOnDemand]: 11/30 looper letters, 880 selfloop transitions, 1328 changer transitions 52/2261 dead transitions. [2024-06-03 19:05:09,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 2261 transitions, 37723 flow [2024-06-03 19:05:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-06-03 19:05:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2024-06-03 19:05:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 836 transitions. [2024-06-03 19:05:09,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817351598173516 [2024-06-03 19:05:09,895 INFO L175 Difference]: Start difference. First operand has 196 places, 407 transitions, 5132 flow. Second operand 73 states and 836 transitions. [2024-06-03 19:05:09,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 2261 transitions, 37723 flow [2024-06-03 19:05:19,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 2261 transitions, 35078 flow, removed 1313 selfloop flow, removed 9 redundant places. [2024-06-03 19:05:19,045 INFO L231 Difference]: Finished difference. Result has 296 places, 1804 transitions, 30389 flow [2024-06-03 19:05:19,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4692, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=30389, PETRI_PLACES=296, PETRI_TRANSITIONS=1804} [2024-06-03 19:05:19,046 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 265 predicate places. [2024-06-03 19:05:19,046 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 1804 transitions, 30389 flow [2024-06-03 19:05:19,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 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-03 19:05:19,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:19,047 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, 1] [2024-06-03 19:05:19,065 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-03 19:05:19,262 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-03 19:05:19,262 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-03 19:05:19,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash 631407371, now seen corresponding path program 2 times [2024-06-03 19:05:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74805746] [2024-06-03 19:05:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:19,279 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 19:05:19,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188563968] [2024-06-03 19:05:19,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-03 19:05:19,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 19:05:19,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:05:19,285 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-03 19:05:19,286 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-03 19:05:19,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-03 19:05:19,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-03 19:05:19,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2024-06-03 19:05:19,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 19:05:19,635 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-03 19:05:19,646 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-03 19:05:19,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-03 19:05:20,365 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-03 19:05:20,380 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-03 19:05:20,388 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-03 19:05:20,392 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-03 19:05:20,395 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-03 19:05:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:23,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 19:05:25,082 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-03 19:05:25,120 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-03 19:05:29,001 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-03 19:05:29,262 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-03 19:05:29,361 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-03 19:05:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74805746] [2024-06-03 19:05:31,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 19:05:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188563968] [2024-06-03 19:05:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188563968] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 19:05:31,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 19:05:31,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2024-06-03 19:05:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913650664] [2024-06-03 19:05:31,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 19:05:31,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-06-03 19:05:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-06-03 19:05:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=330, Unknown=1, NotChecked=0, Total=462 [2024-06-03 19:05:32,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 19:05:32,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 1804 transitions, 30389 flow. Second operand has 22 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 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-03 19:05:32,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:32,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 19:05:32,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:32,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~first~0 4294967296)) (.cse30 (mod c_~buffer_size~0 4294967296)) (.cse29 (mod c_~next~0 4294967296))) (let ((.cse6 (< .cse30 (+ .cse29 1))) (.cse10 (< c_~buffer_size~0 1)) (.cse35 (+ .cse36 1)) (.cse14 (<= c_~value~0 6)) (.cse27 (<= 0 c_~value~0)) (.cse8 (= (mod c_~send~0 256) 0))) (let ((.cse19 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse23 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (= (mod c_~receive~0 256) 0)) (.cse1 (not .cse8)) (.cse2 (and .cse14 .cse27)) (.cse28 (not (= (+ c_~value~0 1) 0))) (.cse7 (< .cse30 .cse35)) (.cse32 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse34 (< .cse29 1)) (.cse24 (and (or .cse6 .cse10) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0)))) (.cse25 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse26 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse15 (or .cse24 .cse25 .cse8 .cse9 .cse26)) (.cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (and (or (and (<= 1 .cse29) (<= .cse35 .cse30)) .cse28) (or .cse7 (and (or (< 2147483647 .cse36) (not (= c_~value~0 (select .cse32 (+ |c_~#buffer~0.offset| .cse36))))) (or (not (= (select .cse32 (+ |c_~#buffer~0.offset| .cse36 (- 4294967296))) c_~value~0)) (< .cse36 2147483648))) .cse34))) (.cse22 (or .cse1 .cse2)) (.cse0 (not .cse18)) (.cse4 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse16 (or .cse1 .cse23 .cse2)) (.cse5 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse30) 1)) (.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse21 (and (or .cse28 (< 0 .cse29)) (or (and (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse31 (* v_y_97 4294967296))) (or (< v_z_97 0) (< .cse30 (+ v_z_97 .cse31 1)) (= v_z_97 0) (< (+ v_z_97 .cse31) 0) (not (= c_~value~0 (select .cse32 (+ |~#buffer~0.offset| (- 1) v_z_97)))) (< 2147483648 v_z_97)))) (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse33 (* v_y_97 4294967296))) (or (< .cse30 (+ v_z_97 .cse33 1)) (< .cse30 v_z_97) (< v_z_97 2147483649) (not (= c_~value~0 (select .cse32 (+ |~#buffer~0.offset| v_z_97 (- 4294967297))))) (< (+ v_z_97 .cse33) 0))))) .cse34))) (.cse12 (< 2147483647 c_~value~0)) (.cse20 (< .cse19 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse1 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse12 .cse13))) .cse14 .cse15 (or .cse0 (and (or .cse8 .cse4) .cse16)) (or .cse17 (and (or .cse11 .cse18 .cse1 .cse12) (or (= .cse19 0) .cse8)) .cse20) (or .cse5 .cse11 .cse18 .cse6 .cse21 .cse9 .cse12 .cse4 .cse10) (or .cse0 (and .cse15 .cse22)) (or .cse1 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse23 .cse2) (or .cse24 .cse25 .cse11 .cse18 .cse9 .cse12 .cse26 .cse13) .cse27 (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse5 .cse17 .cse6 .cse8 .cse20 .cse10))) (or .cse11 .cse18 .cse12 .cse13 .cse4) .cse22 (or .cse0 (and (or .cse5 .cse6 .cse8 .cse9 .cse4 .cse10) .cse16)) (or .cse5 .cse17 .cse11 .cse18 .cse6 .cse21 .cse12 .cse20 .cse10)))))) is different from false [2024-06-03 19:05:37,182 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse29 (mod c_~first~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296)) (.cse17 (mod c_~next~0 4294967296))) (let ((.cse5 (< .cse18 (+ .cse17 1))) (.cse9 (< c_~buffer_size~0 1)) (.cse28 (+ .cse29 1)) (.cse7 (= (mod c_~send~0 256) 0))) (let ((.cse14 (= (mod c_~receive~0 256) 0)) (.cse1 (not .cse7)) (.cse2 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse16 (not (= (+ c_~value~0 1) 0))) (.cse6 (< .cse18 .cse28)) (.cse20 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse17 1)) (.cse25 (and (or .cse5 .cse9) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0)))) (.cse26 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse8 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse27 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse13 (or .cse25 .cse26 .cse7 .cse8 .cse27)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse17) (<= .cse28 .cse18)) .cse16) (or .cse6 (and (or (< 2147483647 .cse29) (not (= c_~value~0 (select .cse20 (+ |c_~#buffer~0.offset| .cse29))))) (or (not (= (select .cse20 (+ |c_~#buffer~0.offset| .cse29 (- 4294967296))) c_~value~0)) (< .cse29 2147483648))) .cse22))) (.cse23 (or .cse1 .cse2)) (.cse0 (not .cse14)) (.cse4 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse3 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse24 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 .cse1 .cse2 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse1 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12))) .cse13 (let ((.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (and (or .cse10 .cse14 .cse1 .cse11) (or (= .cse15 0) .cse7)) (< .cse15 0))) (or .cse4 .cse10 .cse14 .cse5 (and (or .cse16 (< 0 .cse17)) (or (and (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse19 (* v_y_97 4294967296))) (or (< v_z_97 0) (< .cse18 (+ v_z_97 .cse19 1)) (= v_z_97 0) (< (+ v_z_97 .cse19) 0) (not (= c_~value~0 (select .cse20 (+ |~#buffer~0.offset| (- 1) v_z_97)))) (< 2147483648 v_z_97)))) (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse21 (* v_y_97 4294967296))) (or (< .cse18 (+ v_z_97 .cse21 1)) (< .cse18 v_z_97) (< v_z_97 2147483649) (not (= c_~value~0 (select .cse20 (+ |~#buffer~0.offset| v_z_97 (- 4294967297))))) (< (+ v_z_97 .cse21) 0))))) .cse22)) .cse8 .cse11 .cse3 .cse9) (or .cse0 (and .cse13 .cse23)) (or .cse1 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse24 .cse2) (or .cse25 .cse26 .cse10 .cse14 .cse8 .cse11 .cse27 .cse12) .cse23 (or .cse0 (and (or .cse4 .cse5 .cse7 .cse8 .cse3 .cse9) (or .cse1 .cse24 .cse2)))))))) is different from false [2024-06-03 19:05:41,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 19:05:43,041 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= (mod c_~send~0 256) 0)) (.cse12 (mod c_~buffer_size~0 4294967296)) (.cse19 (= (mod c_~receive~0 256) 0)) (.cse10 (mod c_~next~0 4294967296))) (let ((.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse13 (not (= (+ c_~value~0 1) 0))) (.cse15 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse16 (< .cse10 1)) (.cse9 (< 2147483647 c_~value~0)) (.cse17 (not .cse19)) (.cse1 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse12) 1)) (.cse2 (< .cse12 (+ .cse10 1))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse0 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse6 (< c_~buffer_size~0 1)) (.cse8 (not .cse4)) (.cse22 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (let ((.cse14 (mod c_~first~0 4294967296))) (let ((.cse11 (+ .cse14 1))) (let ((.cse3 (< .cse12 .cse11))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse9 (and (or (and (<= 1 .cse10) (<= .cse11 .cse12)) .cse13) (or .cse3 (and (or (< 2147483647 .cse14) (not (= c_~value~0 (select .cse15 (+ |c_~#buffer~0.offset| .cse14))))) (or (not (= (select .cse15 (+ |c_~#buffer~0.offset| .cse14 (- 4294967296))) c_~value~0)) (< .cse14 2147483648))) .cse16)))))))) (or .cse17 .cse8 .cse18) (or .cse1 .cse7 .cse19 .cse2 (and (or .cse13 (< 0 .cse10)) (or (and (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse20 (* v_y_97 4294967296))) (or (< v_z_97 0) (< .cse12 (+ v_z_97 .cse20 1)) (= v_z_97 0) (< (+ v_z_97 .cse20) 0) (not (= c_~value~0 (select .cse15 (+ |~#buffer~0.offset| (- 1) v_z_97)))) (< 2147483648 v_z_97)))) (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse21 (* v_y_97 4294967296))) (or (< .cse12 (+ v_z_97 .cse21 1)) (< .cse12 v_z_97) (< v_z_97 2147483649) (not (= c_~value~0 (select .cse15 (+ |~#buffer~0.offset| v_z_97 (- 4294967297))))) (< (+ v_z_97 .cse21) 0))))) .cse16)) .cse5 .cse9 .cse0 .cse6) (or .cse8 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse22 .cse18) (or .cse17 (and (or .cse1 .cse2 .cse4 .cse5 .cse0 .cse6) (or .cse8 .cse22 .cse18)))))) is different from false [2024-06-03 19:05:49,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~first~0 4294967296)) (.cse28 (mod c_~buffer_size~0 4294967296)) (.cse27 (mod c_~next~0 4294967296))) (let ((.cse6 (< .cse28 (+ .cse27 1))) (.cse10 (< c_~buffer_size~0 1)) (.cse33 (+ .cse34 1)) (.cse8 (= (mod c_~send~0 256) 0))) (let ((.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse22 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse1 (not .cse8)) (.cse2 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse26 (not (= (+ c_~value~0 1) 0))) (.cse7 (< .cse28 .cse33)) (.cse30 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse32 (< .cse27 1)) (.cse23 (and (or .cse6 .cse10) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0)))) (.cse24 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse25 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse14 (or .cse23 .cse24 .cse8 .cse9 .cse25)) (.cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (and (or (and (<= 1 .cse27) (<= .cse33 .cse28)) .cse26) (or .cse7 (and (or (< 2147483647 .cse34) (not (= c_~value~0 (select .cse30 (+ |c_~#buffer~0.offset| .cse34))))) (or (not (= (select .cse30 (+ |c_~#buffer~0.offset| .cse34 (- 4294967296))) c_~value~0)) (< .cse34 2147483648))) .cse32))) (.cse21 (or .cse1 .cse2)) (.cse0 (not .cse17)) (.cse4 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse15 (or .cse1 .cse22 .cse2)) (.cse5 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse28) 1)) (.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse20 (and (or .cse26 (< 0 .cse27)) (or (and (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse29 (* v_y_97 4294967296))) (or (< v_z_97 0) (< .cse28 (+ v_z_97 .cse29 1)) (= v_z_97 0) (< (+ v_z_97 .cse29) 0) (not (= c_~value~0 (select .cse30 (+ |~#buffer~0.offset| (- 1) v_z_97)))) (< 2147483648 v_z_97)))) (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse31 (* v_y_97 4294967296))) (or (< .cse28 (+ v_z_97 .cse31 1)) (< .cse28 v_z_97) (< v_z_97 2147483649) (not (= c_~value~0 (select .cse30 (+ |~#buffer~0.offset| v_z_97 (- 4294967297))))) (< (+ v_z_97 .cse31) 0))))) .cse32))) (.cse12 (< 2147483647 c_~value~0)) (.cse19 (< .cse18 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse1 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse12 .cse13))) .cse14 (or .cse0 (and (or .cse8 .cse4) .cse15)) (or .cse16 (and (or .cse11 .cse17 .cse1 .cse12) (or (= .cse18 0) .cse8)) .cse19) (or .cse5 .cse11 .cse17 .cse6 .cse20 .cse9 .cse12 .cse4 .cse10) (or .cse0 (and .cse14 .cse21)) (or .cse1 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse22 .cse2) (or .cse23 .cse24 .cse11 .cse17 .cse9 .cse12 .cse25 .cse13) (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse5 .cse16 .cse6 .cse8 .cse19 .cse10))) (or .cse11 .cse17 .cse12 .cse13 .cse4) .cse21 (or .cse0 (and (or .cse5 .cse6 .cse8 .cse9 .cse4 .cse10) .cse15)) (or .cse5 .cse16 .cse11 .cse17 .cse6 .cse20 .cse12 .cse19 .cse10)))))) is different from false [2024-06-03 19:05:59,076 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse35 (mod c_~first~0 4294967296)) (.cse29 (mod c_~buffer_size~0 4294967296)) (.cse28 (mod c_~next~0 4294967296))) (let ((.cse6 (< .cse29 (+ .cse28 1))) (.cse10 (< c_~buffer_size~0 1)) (.cse34 (+ .cse35 1)) (.cse14 (<= c_~value~0 6)) (.cse8 (= (mod c_~send~0 256) 0))) (let ((.cse19 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse23 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (= (mod c_~receive~0 256) 0)) (.cse1 (not .cse8)) (.cse2 (and .cse14 (<= 0 c_~value~0))) (.cse27 (not (= (+ c_~value~0 1) 0))) (.cse7 (< .cse29 .cse34)) (.cse31 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse33 (< .cse28 1)) (.cse24 (and (or .cse6 .cse10) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0)))) (.cse25 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse26 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse15 (or .cse24 .cse25 .cse8 .cse9 .cse26)) (.cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (and (or (and (<= 1 .cse28) (<= .cse34 .cse29)) .cse27) (or .cse7 (and (or (< 2147483647 .cse35) (not (= c_~value~0 (select .cse31 (+ |c_~#buffer~0.offset| .cse35))))) (or (not (= (select .cse31 (+ |c_~#buffer~0.offset| .cse35 (- 4294967296))) c_~value~0)) (< .cse35 2147483648))) .cse33))) (.cse22 (or .cse1 .cse2)) (.cse0 (not .cse18)) (.cse4 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse16 (or .cse1 .cse23 .cse2)) (.cse5 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse29) 1)) (.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse21 (and (or .cse27 (< 0 .cse28)) (or (and (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse30 (* v_y_97 4294967296))) (or (< v_z_97 0) (< .cse29 (+ v_z_97 .cse30 1)) (= v_z_97 0) (< (+ v_z_97 .cse30) 0) (not (= c_~value~0 (select .cse31 (+ |~#buffer~0.offset| (- 1) v_z_97)))) (< 2147483648 v_z_97)))) (forall ((|~#buffer~0.offset| Int) (v_z_97 Int) (v_y_97 Int)) (let ((.cse32 (* v_y_97 4294967296))) (or (< .cse29 (+ v_z_97 .cse32 1)) (< .cse29 v_z_97) (< v_z_97 2147483649) (not (= c_~value~0 (select .cse31 (+ |~#buffer~0.offset| v_z_97 (- 4294967297))))) (< (+ v_z_97 .cse32) 0))))) .cse33))) (.cse12 (< 2147483647 c_~value~0)) (.cse20 (< .cse19 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse1 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse12 .cse13))) .cse14 .cse15 (or .cse0 (and (or .cse8 .cse4) .cse16)) (or .cse17 (and (or .cse11 .cse18 .cse1 .cse12) (or (= .cse19 0) .cse8)) .cse20) (or .cse5 .cse11 .cse18 .cse6 .cse21 .cse9 .cse12 .cse4 .cse10) (or .cse0 (and .cse15 .cse22)) (or .cse1 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse23 .cse2) (or .cse24 .cse25 .cse11 .cse18 .cse9 .cse12 .cse26 .cse13) (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse5 .cse17 .cse6 .cse8 .cse20 .cse10))) (or .cse11 .cse18 .cse12 .cse13 .cse4) .cse22 (<= 2 c_~value~0) (or .cse0 (and (or .cse5 .cse6 .cse8 .cse9 .cse4 .cse10) .cse16)) (or .cse5 .cse17 .cse11 .cse18 .cse6 .cse21 .cse12 .cse20 .cse10)))))) is different from false