./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7225a3dc80a635bdf8bc0a0aebf3fff6c385d87e3635c30eb2fdc2ad9b10efb0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:51:00,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:51:00,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:51:00,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:51:00,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:51:00,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:51:00,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:51:00,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:51:00,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:51:00,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:51:00,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:51:00,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:51:00,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:51:00,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:51:00,647 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:51:00,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:51:00,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:51:00,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:51:00,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:51:00,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:51:00,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:51:00,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:51:00,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:51:00,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:51:00,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:51:00,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:51:00,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:51:00,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:51:00,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:51:00,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:51:00,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:51:00,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:51:00,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:51:00,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:51:00,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:51:00,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:51:00,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:51:00,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:51:00,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:51:00,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:51:00,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:51:00,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:51:00,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:51:00,661 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7225a3dc80a635bdf8bc0a0aebf3fff6c385d87e3635c30eb2fdc2ad9b10efb0 [2024-01-27 15:51:00,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:51:00,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:51:00,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:51:00,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:51:00,907 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:51:00,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2024-01-27 15:51:02,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:51:02,274 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:51:02,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2024-01-27 15:51:02,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422b89ff9/c7902bc116674b5a9075a1c8199c792f/FLAG8db0ce5a3 [2024-01-27 15:51:02,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422b89ff9/c7902bc116674b5a9075a1c8199c792f [2024-01-27 15:51:02,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:51:02,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:51:02,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:51:02,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:51:02,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:51:02,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e8a1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02, skipping insertion in model container [2024-01-27 15:51:02,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:51:02,485 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3095,3108] [2024-01-27 15:51:02,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:51:02,501 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:51:02,522 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3095,3108] [2024-01-27 15:51:02,525 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:51:02,570 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:51:02,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02 WrapperNode [2024-01-27 15:51:02,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:51:02,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:51:02,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:51:02,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:51:02,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,626 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 173 [2024-01-27 15:51:02,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:51:02,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:51:02,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:51:02,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:51:02,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,694 INFO L175 MemorySlicer]: Split 11 memory accesses to 5 slices as follows [2, 2, 3, 2, 2]. 27 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 15:51:02,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:51:02,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:51:02,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:51:02,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:51:02,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (1/1) ... [2024-01-27 15:51:02,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:51:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:02,757 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-01-27 15:51:02,781 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-01-27 15:51:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:51:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:51:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:51:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:51:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:51:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:51:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:51:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:51:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:51:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:51:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:51:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:51:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:51:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:51:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:51:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:51:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:51:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:51:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:51:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:51:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:51:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:51:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:51:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:51:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:51:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:51:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:51:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:51:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:51:02,816 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:51:02,916 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:51:02,918 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:51:03,121 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:51:03,121 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:51:03,329 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:51:03,329 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 15:51:03,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:51:03 BoogieIcfgContainer [2024-01-27 15:51:03,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:51:03,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:51:03,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:51:03,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:51:03,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:51:02" (1/3) ... [2024-01-27 15:51:03,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e540ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:51:03, skipping insertion in model container [2024-01-27 15:51:03,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:51:02" (2/3) ... [2024-01-27 15:51:03,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e540ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:51:03, skipping insertion in model container [2024-01-27 15:51:03,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:51:03" (3/3) ... [2024-01-27 15:51:03,340 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2024-01-27 15:51:03,347 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:51:03,355 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:51:03,355 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:51:03,356 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:51:03,419 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:51:03,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 99 flow [2024-01-27 15:51:03,487 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-01-27 15:51:03,487 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:51:03,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-01-27 15:51:03,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 99 flow [2024-01-27 15:51:03,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-01-27 15:51:03,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:51:03,508 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=true, 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;@5284b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:51:03,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:51:03,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:51:03,532 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-01-27 15:51:03,532 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:51:03,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:03,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:03,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:03,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1956098430, now seen corresponding path program 1 times [2024-01-27 15:51:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073698663] [2024-01-27 15:51:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073698663] [2024-01-27 15:51:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073698663] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:51:04,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:51:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:51:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016890676] [2024-01-27 15:51:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:51:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:51:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:51:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:51:04,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:51:04,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:51:04,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:04,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:51:04,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:04,671 INFO L124 PetriNetUnfolderBase]: 865/1410 cut-off events. [2024-01-27 15:51:04,671 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-01-27 15:51:04,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 1410 events. 865/1410 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6809 event pairs, 151 based on Foata normal form. 92/1484 useless extension candidates. Maximal degree in co-relation 2448. Up to 433 conditions per place. [2024-01-27 15:51:04,686 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 61 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-01-27 15:51:04,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 311 flow [2024-01-27 15:51:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:51:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:51:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-01-27 15:51:04,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2024-01-27 15:51:04,702 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 88 flow. Second operand 6 states and 128 transitions. [2024-01-27 15:51:04,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 311 flow [2024-01-27 15:51:04,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 289 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:51:04,711 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 102 flow [2024-01-27 15:51:04,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-01-27 15:51:04,716 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-01-27 15:51:04,717 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 102 flow [2024-01-27 15:51:04,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:51:04,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:04,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:04,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:51:04,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:04,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 359614103, now seen corresponding path program 1 times [2024-01-27 15:51:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364219883] [2024-01-27 15:51:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364219883] [2024-01-27 15:51:04,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364219883] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:51:04,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:51:04,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:51:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423200323] [2024-01-27 15:51:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:51:04,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:51:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:51:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:51:04,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 15:51:04,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-27 15:51:04,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:04,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 15:51:04,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:05,006 INFO L124 PetriNetUnfolderBase]: 425/845 cut-off events. [2024-01-27 15:51:05,006 INFO L125 PetriNetUnfolderBase]: For 178/247 co-relation queries the response was YES. [2024-01-27 15:51:05,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 845 events. 425/845 cut-off events. For 178/247 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4267 event pairs, 181 based on Foata normal form. 71/863 useless extension candidates. Maximal degree in co-relation 731. Up to 479 conditions per place. [2024-01-27 15:51:05,011 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 29 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2024-01-27 15:51:05,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 201 flow [2024-01-27 15:51:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:51:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:51:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-01-27 15:51:05,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2024-01-27 15:51:05,015 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 102 flow. Second operand 3 states and 79 transitions. [2024-01-27 15:51:05,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 201 flow [2024-01-27 15:51:05,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 15:51:05,017 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 108 flow [2024-01-27 15:51:05,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-01-27 15:51:05,018 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-01-27 15:51:05,018 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 108 flow [2024-01-27 15:51:05,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-27 15:51:05,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:05,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:05,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:51:05,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:05,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 616657969, now seen corresponding path program 1 times [2024-01-27 15:51:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818498888] [2024-01-27 15:51:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:05,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818498888] [2024-01-27 15:51:05,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818498888] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:51:05,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:51:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:51:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008272037] [2024-01-27 15:51:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:51:05,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:51:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:51:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:51:05,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 15:51:05,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-27 15:51:05,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:05,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 15:51:05,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:05,317 INFO L124 PetriNetUnfolderBase]: 492/987 cut-off events. [2024-01-27 15:51:05,317 INFO L125 PetriNetUnfolderBase]: For 319/445 co-relation queries the response was YES. [2024-01-27 15:51:05,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 987 events. 492/987 cut-off events. For 319/445 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5467 event pairs, 416 based on Foata normal form. 94/962 useless extension candidates. Maximal degree in co-relation 1249. Up to 621 conditions per place. [2024-01-27 15:51:05,323 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 24 selfloop transitions, 2 changer transitions 14/53 dead transitions. [2024-01-27 15:51:05,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 222 flow [2024-01-27 15:51:05,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:51:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:51:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-01-27 15:51:05,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-01-27 15:51:05,328 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 108 flow. Second operand 4 states and 96 transitions. [2024-01-27 15:51:05,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 222 flow [2024-01-27 15:51:05,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:51:05,332 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 120 flow [2024-01-27 15:51:05,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-01-27 15:51:05,333 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-01-27 15:51:05,334 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 120 flow [2024-01-27 15:51:05,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-27 15:51:05,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:05,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:05,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:51:05,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:05,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -621043479, now seen corresponding path program 1 times [2024-01-27 15:51:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:05,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213698234] [2024-01-27 15:51:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213698234] [2024-01-27 15:51:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213698234] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:51:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851755203] [2024-01-27 15:51:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:06,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:06,061 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-01-27 15:51:06,083 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-01-27 15:51:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:06,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjunts are in the unsatisfiable core [2024-01-27 15:51:06,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:06,267 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 23 treesize of output 1 [2024-01-27 15:51:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:06,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:07,384 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 40 treesize of output 36 [2024-01-27 15:51:07,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:51:07,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 46 [2024-01-27 15:51:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851755203] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:07,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:51:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2024-01-27 15:51:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841898228] [2024-01-27 15:51:07,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:07,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-01-27 15:51:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:07,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-01-27 15:51:07,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2024-01-27 15:51:07,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2024-01-27 15:51:07,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 120 flow. Second operand has 32 states, 32 states have (on average 8.875) internal successors, (284), 32 states have internal predecessors, (284), 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-01-27 15:51:07,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:07,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2024-01-27 15:51:07,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:10,700 INFO L124 PetriNetUnfolderBase]: 4678/7466 cut-off events. [2024-01-27 15:51:10,701 INFO L125 PetriNetUnfolderBase]: For 2352/2352 co-relation queries the response was YES. [2024-01-27 15:51:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17080 conditions, 7466 events. 4678/7466 cut-off events. For 2352/2352 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 43370 event pairs, 486 based on Foata normal form. 120/7134 useless extension candidates. Maximal degree in co-relation 17064. Up to 1448 conditions per place. [2024-01-27 15:51:10,730 INFO L140 encePairwiseOnDemand]: 22/39 looper letters, 217 selfloop transitions, 78 changer transitions 71/369 dead transitions. [2024-01-27 15:51:10,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 369 transitions, 1773 flow [2024-01-27 15:51:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-01-27 15:51:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-01-27 15:51:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 575 transitions. [2024-01-27 15:51:10,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42124542124542125 [2024-01-27 15:51:10,734 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 120 flow. Second operand 35 states and 575 transitions. [2024-01-27 15:51:10,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 369 transitions, 1773 flow [2024-01-27 15:51:10,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 369 transitions, 1757 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-01-27 15:51:10,746 INFO L231 Difference]: Finished difference. Result has 96 places, 121 transitions, 712 flow [2024-01-27 15:51:10,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=712, PETRI_PLACES=96, PETRI_TRANSITIONS=121} [2024-01-27 15:51:10,748 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-01-27 15:51:10,748 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 712 flow [2024-01-27 15:51:10,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.875) internal successors, (284), 32 states have internal predecessors, (284), 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-01-27 15:51:10,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:10,749 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:10,771 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-01-27 15:51:10,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:10,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:10,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679297, now seen corresponding path program 2 times [2024-01-27 15:51:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093025234] [2024-01-27 15:51:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093025234] [2024-01-27 15:51:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093025234] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:51:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930466648] [2024-01-27 15:51:11,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:51:11,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:11,892 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-01-27 15:51:11,920 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-01-27 15:51:12,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:51:12,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:12,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2024-01-27 15:51:12,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:12,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:12,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:51:12,407 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 28 treesize of output 20 [2024-01-27 15:51:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:51:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930466648] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:12,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:51:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2024-01-27 15:51:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944465123] [2024-01-27 15:51:12,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:12,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-01-27 15:51:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-01-27 15:51:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2024-01-27 15:51:12,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2024-01-27 15:51:12,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 121 transitions, 712 flow. Second operand has 32 states, 32 states have (on average 7.8125) internal successors, (250), 32 states have internal predecessors, (250), 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-01-27 15:51:12,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:12,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2024-01-27 15:51:12,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:15,882 INFO L124 PetriNetUnfolderBase]: 4356/6680 cut-off events. [2024-01-27 15:51:15,882 INFO L125 PetriNetUnfolderBase]: For 11978/11978 co-relation queries the response was YES. [2024-01-27 15:51:15,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21293 conditions, 6680 events. 4356/6680 cut-off events. For 11978/11978 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 33354 event pairs, 123 based on Foata normal form. 116/6794 useless extension candidates. Maximal degree in co-relation 20258. Up to 1482 conditions per place. [2024-01-27 15:51:15,933 INFO L140 encePairwiseOnDemand]: 21/39 looper letters, 324 selfloop transitions, 184 changer transitions 85/595 dead transitions. [2024-01-27 15:51:15,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 595 transitions, 3822 flow [2024-01-27 15:51:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-01-27 15:51:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-01-27 15:51:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 744 transitions. [2024-01-27 15:51:15,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34685314685314683 [2024-01-27 15:51:15,937 INFO L175 Difference]: Start difference. First operand has 96 places, 121 transitions, 712 flow. Second operand 55 states and 744 transitions. [2024-01-27 15:51:15,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 595 transitions, 3822 flow [2024-01-27 15:51:16,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 595 transitions, 3707 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-01-27 15:51:16,011 INFO L231 Difference]: Finished difference. Result has 173 places, 229 transitions, 1950 flow [2024-01-27 15:51:16,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=1950, PETRI_PLACES=173, PETRI_TRANSITIONS=229} [2024-01-27 15:51:16,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2024-01-27 15:51:16,013 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 229 transitions, 1950 flow [2024-01-27 15:51:16,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.8125) internal successors, (250), 32 states have internal predecessors, (250), 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-01-27 15:51:16,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:16,013 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:16,028 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-01-27 15:51:16,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:16,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:16,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 315982488, now seen corresponding path program 3 times [2024-01-27 15:51:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520298262] [2024-01-27 15:51:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520298262] [2024-01-27 15:51:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520298262] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:51:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705885332] [2024-01-27 15:51:16,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:51:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:16,300 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-01-27 15:51:16,304 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-01-27 15:51:16,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:51:16,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:16,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:51:16,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:16,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705885332] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:16,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:51:16,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-01-27 15:51:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103101206] [2024-01-27 15:51:16,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:16,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 15:51:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:16,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 15:51:16,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:51:16,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 15:51:16,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 229 transitions, 1950 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-27 15:51:16,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:16,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 15:51:16,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:17,390 INFO L124 PetriNetUnfolderBase]: 2696/5215 cut-off events. [2024-01-27 15:51:17,391 INFO L125 PetriNetUnfolderBase]: For 28354/28688 co-relation queries the response was YES. [2024-01-27 15:51:17,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22462 conditions, 5215 events. 2696/5215 cut-off events. For 28354/28688 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 34427 event pairs, 377 based on Foata normal form. 182/5173 useless extension candidates. Maximal degree in co-relation 21830. Up to 1434 conditions per place. [2024-01-27 15:51:17,448 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 209 selfloop transitions, 25 changer transitions 34/375 dead transitions. [2024-01-27 15:51:17,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 375 transitions, 3539 flow [2024-01-27 15:51:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:51:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:51:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-01-27 15:51:17,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2024-01-27 15:51:17,449 INFO L175 Difference]: Start difference. First operand has 173 places, 229 transitions, 1950 flow. Second operand 4 states and 118 transitions. [2024-01-27 15:51:17,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 375 transitions, 3539 flow [2024-01-27 15:51:17,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 375 transitions, 3246 flow, removed 70 selfloop flow, removed 8 redundant places. [2024-01-27 15:51:17,578 INFO L231 Difference]: Finished difference. Result has 170 places, 247 transitions, 1988 flow [2024-01-27 15:51:17,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1988, PETRI_PLACES=170, PETRI_TRANSITIONS=247} [2024-01-27 15:51:17,579 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places. [2024-01-27 15:51:17,579 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 247 transitions, 1988 flow [2024-01-27 15:51:17,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-27 15:51:17,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:17,580 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:17,598 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-01-27 15:51:17,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:17,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:17,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2008007372, now seen corresponding path program 4 times [2024-01-27 15:51:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:17,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125082609] [2024-01-27 15:51:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125082609] [2024-01-27 15:51:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125082609] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:51:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217255458] [2024-01-27 15:51:17,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:51:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:17,964 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-01-27 15:51:17,971 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-01-27 15:51:18,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:51:18,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:18,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:51:18,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:18,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:51:18,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217255458] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:18,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:51:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-01-27 15:51:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681542343] [2024-01-27 15:51:18,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:18,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 15:51:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 15:51:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:51:18,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 15:51:18,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 247 transitions, 1988 flow. Second operand has 12 states, 12 states have (on average 17.75) internal successors, (213), 12 states have internal predecessors, (213), 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-01-27 15:51:18,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:18,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 15:51:18,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:18,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L71-->L75: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (not (= (ite (and (< v_~front~0_69 v_~n~0_58) (< v_~front~0_69 v_~back~0_74) (<= 0 v_~front~0_69)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_3| (select (select |v_#memory_int#2_41| v_~queue~0.base_67) (+ (* v_~front~0_69 4) v_~queue~0.offset_67)))) InVars {~queue~0.offset=v_~queue~0.offset_67, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_69} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_3|, ~queue~0.offset=v_~queue~0.offset_67, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][197], [18#thread1EXITtrue, 32#L110-4true, 524#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 973#true, 27#thread3EXITtrue, 74#true, 11#L75true, Black: 61#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 59#(and (= ~d~0 0) (= ~v_assert~0 1) (<= 0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 66#(<= ~back~0 ~front~0), Black: 70#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 662#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 745#(<= ~back~0 (+ ~front~0 1)), Black: 688#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 628#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 624#(and (= ~d~0 0) (or (< ~back~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 3))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 744#(<= ~back~0 ~front~0), Black: 648#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 656#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 642#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 632#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 577#(or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 686#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 712#(and (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 692#(and (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 640#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 660#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 594#(or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 702#(and (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 682#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 381#true, Black: 674#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 670#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 694#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 704#(and (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 636#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 710#(and (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 319#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 325#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 345#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 321#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 343#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 341#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), Black: 331#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (< ~front~0 0))), Black: 311#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 329#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 337#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 317#(and (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 85#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 309#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 313#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1))]) [2024-01-27 15:51:18,968 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-01-27 15:51:18,968 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:51:18,968 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:51:18,968 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:51:18,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L71-->L75: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (not (= (ite (and (< v_~front~0_69 v_~n~0_58) (< v_~front~0_69 v_~back~0_74) (<= 0 v_~front~0_69)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_3| (select (select |v_#memory_int#2_41| v_~queue~0.base_67) (+ (* v_~front~0_69 4) v_~queue~0.offset_67)))) InVars {~queue~0.offset=v_~queue~0.offset_67, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_69} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_3|, ~queue~0.offset=v_~queue~0.offset_67, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][197], [524#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 973#true, 27#thread3EXITtrue, 74#true, 11#L75true, Black: 61#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 59#(and (= ~d~0 0) (= ~v_assert~0 1) (<= 0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 66#(<= ~back~0 ~front~0), Black: 70#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 662#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 745#(<= ~back~0 (+ ~front~0 1)), Black: 688#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 628#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 624#(and (= ~d~0 0) (or (< ~back~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 3))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 648#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 744#(<= ~back~0 ~front~0), Black: 656#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 642#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 632#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 577#(or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 686#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 712#(and (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 692#(and (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 640#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 660#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 594#(or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 702#(and (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 682#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 381#true, Black: 674#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 670#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 694#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 704#(and (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 636#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 710#(and (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 319#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 325#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 345#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 321#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 343#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 341#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), Black: 331#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (< ~front~0 0))), Black: 311#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 329#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 337#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 317#(and (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 85#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 309#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), 35#L111-2true, Black: 313#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1))]) [2024-01-27 15:51:18,970 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-01-27 15:51:18,970 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-27 15:51:18,970 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-27 15:51:18,971 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-27 15:51:18,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L71-->L75: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (not (= (ite (and (< v_~front~0_69 v_~n~0_58) (< v_~front~0_69 v_~back~0_74) (<= 0 v_~front~0_69)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_3| (select (select |v_#memory_int#2_41| v_~queue~0.base_67) (+ (* v_~front~0_69 4) v_~queue~0.offset_67)))) InVars {~queue~0.offset=v_~queue~0.offset_67, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_69} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_3|, ~queue~0.offset=v_~queue~0.offset_67, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][197], [18#thread1EXITtrue, 524#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 973#true, 27#thread3EXITtrue, 74#true, 11#L75true, Black: 61#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 59#(and (= ~d~0 0) (= ~v_assert~0 1) (<= 0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 66#(<= ~back~0 ~front~0), Black: 70#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 662#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 745#(<= ~back~0 (+ ~front~0 1)), Black: 688#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 628#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 624#(and (= ~d~0 0) (or (< ~back~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 3))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 648#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 744#(<= ~back~0 ~front~0), Black: 656#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 642#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 632#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 577#(or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 686#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 712#(and (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 692#(and (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 640#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 660#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 594#(or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 702#(and (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 682#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 381#true, Black: 674#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 670#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 694#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 704#(and (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 636#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 710#(and (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 319#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 325#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 345#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 321#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 343#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 341#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), Black: 331#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (< ~front~0 0))), Black: 311#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 329#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 337#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 317#(and (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 85#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 309#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 313#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), 13#L111-1true, Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1))]) [2024-01-27 15:51:18,971 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-01-27 15:51:18,971 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:51:18,971 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:51:18,972 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:51:18,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L71-->L75: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (not (= (ite (and (< v_~front~0_69 v_~n~0_58) (< v_~front~0_69 v_~back~0_74) (<= 0 v_~front~0_69)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_3| (select (select |v_#memory_int#2_41| v_~queue~0.base_67) (+ (* v_~front~0_69 4) v_~queue~0.offset_67)))) InVars {~queue~0.offset=v_~queue~0.offset_67, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_69} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_3|, ~queue~0.offset=v_~queue~0.offset_67, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_74, ~queue~0.base=v_~queue~0.base_67, #memory_int#2=|v_#memory_int#2_41|, ~n~0=v_~n~0_58, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][197], [524#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 973#true, 40#L112-1true, 27#thread3EXITtrue, 74#true, 11#L75true, Black: 61#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 59#(and (= ~d~0 0) (= ~v_assert~0 1) (<= 0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 66#(<= ~back~0 ~front~0), Black: 70#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 662#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 745#(<= ~back~0 (+ ~front~0 1)), Black: 688#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 628#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 624#(and (= ~d~0 0) (or (< ~back~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 3))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 648#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 744#(<= ~back~0 ~front~0), Black: 656#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 642#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= 0 ~W~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 632#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 577#(or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 686#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 712#(and (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 692#(and (or (= ~back~0 ~front~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 640#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 660#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 594#(or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))), Black: 702#(and (= ~v_assert~0 1) (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 682#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 381#true, Black: 674#(and (= ~v_assert~0 1) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 670#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0) (or (= ~back~0 ~front~0) (< |thread1Thread1of1ForFork2_~w~0#1| 1))), Black: 694#(and (<= ~d~0 1) (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 ~W~0)), Black: 704#(and (= ~v_assert~0 1) (or (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 636#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 710#(and (or (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 319#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 325#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 345#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 321#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 343#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 341#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), Black: 331#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< |thread1Thread1of1ForFork2_~w~0#1| 1) (< ~front~0 0))), Black: 311#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 329#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 337#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 317#(and (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 85#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 309#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 313#(and (= ~d~0 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1)), Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~d~0 0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~n~0 1))]) [2024-01-27 15:51:18,972 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-01-27 15:51:18,973 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:51:18,973 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:51:18,973 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:51:18,973 INFO L124 PetriNetUnfolderBase]: 2220/4356 cut-off events. [2024-01-27 15:51:18,973 INFO L125 PetriNetUnfolderBase]: For 23413/23728 co-relation queries the response was YES. [2024-01-27 15:51:18,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18948 conditions, 4356 events. 2220/4356 cut-off events. For 23413/23728 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 27884 event pairs, 880 based on Foata normal form. 84/4248 useless extension candidates. Maximal degree in co-relation 18771. Up to 2679 conditions per place. [2024-01-27 15:51:19,009 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 106 selfloop transitions, 3 changer transitions 47/240 dead transitions. [2024-01-27 15:51:19,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 240 transitions, 2120 flow [2024-01-27 15:51:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:51:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:51:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-01-27 15:51:19,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683760683760684 [2024-01-27 15:51:19,011 INFO L175 Difference]: Start difference. First operand has 170 places, 247 transitions, 1988 flow. Second operand 6 states and 133 transitions. [2024-01-27 15:51:19,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 240 transitions, 2120 flow [2024-01-27 15:51:19,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 240 transitions, 2092 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-01-27 15:51:19,093 INFO L231 Difference]: Finished difference. Result has 174 places, 193 transitions, 1519 flow [2024-01-27 15:51:19,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1519, PETRI_PLACES=174, PETRI_TRANSITIONS=193} [2024-01-27 15:51:19,095 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places. [2024-01-27 15:51:19,095 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 193 transitions, 1519 flow [2024-01-27 15:51:19,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.75) internal successors, (213), 12 states have internal predecessors, (213), 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-01-27 15:51:19,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:19,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:19,115 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-01-27 15:51:19,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:19,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:19,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1898827196, now seen corresponding path program 5 times [2024-01-27 15:51:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831948509] [2024-01-27 15:51:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:20,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:20,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831948509] [2024-01-27 15:51:20,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831948509] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:51:20,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827767764] [2024-01-27 15:51:20,521 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:51:20,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:20,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:20,523 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-01-27 15:51:20,546 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-01-27 15:51:20,644 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:51:20,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:20,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 37 conjunts are in the unsatisfiable core [2024-01-27 15:51:20,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:21,701 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-01-27 15:51:21,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 19 [2024-01-27 15:51:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:21,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:22,372 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-01-27 15:51:22,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 45 [2024-01-27 15:51:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:23,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827767764] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:23,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:51:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2024-01-27 15:51:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066069060] [2024-01-27 15:51:23,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:23,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-01-27 15:51:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:23,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-01-27 15:51:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2093, Unknown=0, NotChecked=0, Total=2352 [2024-01-27 15:51:23,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2024-01-27 15:51:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 193 transitions, 1519 flow. Second operand has 49 states, 49 states have (on average 7.285714285714286) internal successors, (357), 49 states have internal predecessors, (357), 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-01-27 15:51:23,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:23,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2024-01-27 15:51:23,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:53,541 INFO L124 PetriNetUnfolderBase]: 30628/46364 cut-off events. [2024-01-27 15:51:53,541 INFO L125 PetriNetUnfolderBase]: For 207099/207099 co-relation queries the response was YES. [2024-01-27 15:51:53,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197254 conditions, 46364 events. 30628/46364 cut-off events. For 207099/207099 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 303713 event pairs, 1532 based on Foata normal form. 570/46934 useless extension candidates. Maximal degree in co-relation 197186. Up to 6612 conditions per place. [2024-01-27 15:51:54,018 INFO L140 encePairwiseOnDemand]: 18/39 looper letters, 1631 selfloop transitions, 980 changer transitions 546/3159 dead transitions. [2024-01-27 15:51:54,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 3159 transitions, 26250 flow [2024-01-27 15:51:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 302 states. [2024-01-27 15:51:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2024-01-27 15:51:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 4077 transitions. [2024-01-27 15:51:54,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2024-01-27 15:51:54,042 INFO L175 Difference]: Start difference. First operand has 174 places, 193 transitions, 1519 flow. Second operand 302 states and 4077 transitions. [2024-01-27 15:51:54,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 3159 transitions, 26250 flow [2024-01-27 15:51:55,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 3159 transitions, 25900 flow, removed 132 selfloop flow, removed 15 redundant places. [2024-01-27 15:51:55,655 INFO L231 Difference]: Finished difference. Result has 545 places, 1081 transitions, 12207 flow [2024-01-27 15:51:55,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=302, PETRI_FLOW=12207, PETRI_PLACES=545, PETRI_TRANSITIONS=1081} [2024-01-27 15:51:55,657 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 504 predicate places. [2024-01-27 15:51:55,657 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 1081 transitions, 12207 flow [2024-01-27 15:51:55,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.285714285714286) internal successors, (357), 49 states have internal predecessors, (357), 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-01-27 15:51:55,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:55,658 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:51:55,671 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-01-27 15:51:55,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:55,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:51:55,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash 522737422, now seen corresponding path program 6 times [2024-01-27 15:51:55,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:51:55,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454151602] [2024-01-27 15:51:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:51:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:51:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:51:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:56,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:51:56,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454151602] [2024-01-27 15:51:56,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454151602] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:51:56,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809555555] [2024-01-27 15:51:56,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:51:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:51:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:51:56,918 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-01-27 15:51:56,920 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-01-27 15:51:57,046 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-27 15:51:57,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:57,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 40 conjunts are in the unsatisfiable core [2024-01-27 15:51:57,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:57,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:58,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:51:58,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 53 [2024-01-27 15:51:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:51:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809555555] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:58,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:51:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2024-01-27 15:51:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592871456] [2024-01-27 15:51:58,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:58,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-01-27 15:51:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:51:58,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-01-27 15:51:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2024-01-27 15:51:58,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2024-01-27 15:51:58,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 1081 transitions, 12207 flow. Second operand has 47 states, 47 states have (on average 8.48936170212766) internal successors, (399), 47 states have internal predecessors, (399), 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-01-27 15:51:58,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:58,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2024-01-27 15:51:58,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:23,803 INFO L124 PetriNetUnfolderBase]: 30475/48493 cut-off events. [2024-01-27 15:52:23,804 INFO L125 PetriNetUnfolderBase]: For 1682562/1682562 co-relation queries the response was YES. [2024-01-27 15:52:24,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335567 conditions, 48493 events. 30475/48493 cut-off events. For 1682562/1682562 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 354186 event pairs, 2621 based on Foata normal form. 376/48795 useless extension candidates. Maximal degree in co-relation 334568. Up to 11160 conditions per place. [2024-01-27 15:52:24,964 INFO L140 encePairwiseOnDemand]: 22/39 looper letters, 1217 selfloop transitions, 1391 changer transitions 494/3117 dead transitions. [2024-01-27 15:52:24,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 3117 transitions, 41827 flow [2024-01-27 15:52:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-01-27 15:52:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2024-01-27 15:52:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 2093 transitions. [2024-01-27 15:52:24,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3752913752913753 [2024-01-27 15:52:24,969 INFO L175 Difference]: Start difference. First operand has 545 places, 1081 transitions, 12207 flow. Second operand 143 states and 2093 transitions. [2024-01-27 15:52:24,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 3117 transitions, 41827 flow [2024-01-27 15:52:43,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 3117 transitions, 35966 flow, removed 1892 selfloop flow, removed 48 redundant places. [2024-01-27 15:52:43,035 INFO L231 Difference]: Finished difference. Result has 649 places, 1742 transitions, 22038 flow [2024-01-27 15:52:43,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=9416, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=639, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=143, PETRI_FLOW=22038, PETRI_PLACES=649, PETRI_TRANSITIONS=1742} [2024-01-27 15:52:43,037 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 608 predicate places. [2024-01-27 15:52:43,037 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 1742 transitions, 22038 flow [2024-01-27 15:52:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 8.48936170212766) internal successors, (399), 47 states have internal predecessors, (399), 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-01-27 15:52:43,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:43,038 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:43,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-27 15:52:43,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:43,239 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:52:43,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -62747642, now seen corresponding path program 7 times [2024-01-27 15:52:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500716224] [2024-01-27 15:52:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500716224] [2024-01-27 15:52:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500716224] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611032500] [2024-01-27 15:52:44,273 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:52:44,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:44,297 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-01-27 15:52:44,298 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-01-27 15:52:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:44,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjunts are in the unsatisfiable core [2024-01-27 15:52:44,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:45,066 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-01-27 15:52:45,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2024-01-27 15:52:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:45,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:52:45,601 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-01-27 15:52:45,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 45 [2024-01-27 15:52:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611032500] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:52:46,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:52:46,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2024-01-27 15:52:46,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321965335] [2024-01-27 15:52:46,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:52:46,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-01-27 15:52:46,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-01-27 15:52:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2024-01-27 15:52:46,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2024-01-27 15:52:46,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 1742 transitions, 22038 flow. Second operand has 47 states, 47 states have (on average 8.446808510638299) internal successors, (397), 47 states have internal predecessors, (397), 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-01-27 15:52:46,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:46,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2024-01-27 15:52:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand