./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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/test-hard1.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 782f6af95152c43f9bba17dfd450d57dc3073723e35aa3f98da1f0b96067f4d1 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:45:54,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:45:54,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:45:54,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:45:54,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:45:54,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:45:54,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:45:54,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:45:54,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:45:54,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:45:54,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:45:54,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:45:54,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:45:54,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:45:54,401 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:45:54,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:45:54,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:45:54,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:45:54,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:45:54,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:45:54,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:45:54,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:45:54,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:45:54,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:45:54,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:45:54,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:45:54,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:45:54,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:45:54,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:45:54,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:45:54,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:45:54,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:45:54,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:45:54,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:45:54,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:45:54,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:45:54,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:45:54,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:45:54,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:45:54,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:45:54,421 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:45:54,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:45:54,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:45:54,422 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 -> 782f6af95152c43f9bba17dfd450d57dc3073723e35aa3f98da1f0b96067f4d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:45:54,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:45:54,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:45:54,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:45:54,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:45:54,611 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:45:54,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-02-20 12:45:55,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:45:55,828 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:45:55,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-02-20 12:45:55,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9f57d75/d1554036a58b494295bf0068850bcadb/FLAGecab66d86 [2024-02-20 12:45:55,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9f57d75/d1554036a58b494295bf0068850bcadb [2024-02-20 12:45:55,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:45:55,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:45:55,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:45:55,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:45:55,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:45:55,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:45:55" (1/1) ... [2024-02-20 12:45:55,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a825c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:55, skipping insertion in model container [2024-02-20 12:45:55,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:45:55" (1/1) ... [2024-02-20 12:45:55,898 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:45:56,043 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/test-hard1.wvr.c[3373,3386] [2024-02-20 12:45:56,047 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:45:56,054 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:45:56,080 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/test-hard1.wvr.c[3373,3386] [2024-02-20 12:45:56,081 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:45:56,093 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:45:56,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56 WrapperNode [2024-02-20 12:45:56,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:45:56,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:45:56,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:45:56,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:45:56,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,121 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-02-20 12:45:56,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:45:56,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:45:56,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:45:56,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:45:56,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,149 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 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-02-20 12:45:56,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:45:56,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:45:56,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:45:56,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:45:56,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (1/1) ... [2024-02-20 12:45:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:45:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:45:56,205 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-02-20 12:45:56,210 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-02-20 12:45:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:45:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:45:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:45:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:45:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:45:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:45:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:45:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-20 12:45:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-20 12:45:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:45:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:45:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:45:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:45:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 12:45:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:45:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:45:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:45:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:45:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:45:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:45:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:45:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 12:45:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:45:56,244 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:45:56,352 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:45:56,354 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:45:56,633 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:45:56,633 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:45:56,843 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:45:56,843 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-20 12:45:56,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:45:56 BoogieIcfgContainer [2024-02-20 12:45:56,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:45:56,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:45:56,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:45:56,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:45:56,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:45:55" (1/3) ... [2024-02-20 12:45:56,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0b1c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:45:56, skipping insertion in model container [2024-02-20 12:45:56,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:45:56" (2/3) ... [2024-02-20 12:45:56,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0b1c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:45:56, skipping insertion in model container [2024-02-20 12:45:56,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:45:56" (3/3) ... [2024-02-20 12:45:56,858 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-02-20 12:45:56,872 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:45:56,873 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:45:56,873 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:45:56,971 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-20 12:45:56,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 114 flow [2024-02-20 12:45:57,023 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2024-02-20 12:45:57,024 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 12:45:57,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 4/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-02-20 12:45:57,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 114 flow [2024-02-20 12:45:57,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 100 flow [2024-02-20 12:45:57,043 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:45:57,050 INFO L369 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=All, 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;@130db324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:45:57,051 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-20 12:45:57,067 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:45:57,067 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-02-20 12:45:57,067 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 12:45:57,068 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:45:57,068 INFO L234 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] [2024-02-20 12:45:57,069 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:45:57,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:45:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1828994504, now seen corresponding path program 1 times [2024-02-20 12:45:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:45:57,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862049326] [2024-02-20 12:45:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:45:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:45:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:45:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:45:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:45:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862049326] [2024-02-20 12:45:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862049326] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:45:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:45:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:45:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038057868] [2024-02-20 12:45:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:45:57,447 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:45:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:45:57,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:45:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:45:57,483 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-02-20 12:45:57,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02-20 12:45:57,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:45:57,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-02-20 12:45:57,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:45:57,772 INFO L124 PetriNetUnfolderBase]: 1537/2430 cut-off events. [2024-02-20 12:45:57,773 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-02-20 12:45:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 2430 events. 1537/2430 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12522 event pairs, 141 based on Foata normal form. 1/2404 useless extension candidates. Maximal degree in co-relation 3466. Up to 1733 conditions per place. [2024-02-20 12:45:57,796 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 41 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-02-20 12:45:57,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 259 flow [2024-02-20 12:45:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:45:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:45:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-02-20 12:45:57,808 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2024-02-20 12:45:57,811 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-02-20 12:45:57,811 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 60 transitions, 259 flow [2024-02-20 12:45:57,812 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02-20 12:45:57,812 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:45:57,812 INFO L234 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] [2024-02-20 12:45:57,813 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:45:57,813 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:45:57,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:45:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1237102166, now seen corresponding path program 1 times [2024-02-20 12:45:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:45:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524197120] [2024-02-20 12:45:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:45:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:45:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:45:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:45:58,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:45:58,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524197120] [2024-02-20 12:45:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524197120] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:45:58,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:45:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:45:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546298523] [2024-02-20 12:45:58,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:45:58,233 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:45:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:45:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:45:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:45:58,248 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:45:58,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 60 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:45:58,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:45:58,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:45:58,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:45:58,778 INFO L124 PetriNetUnfolderBase]: 4200/6382 cut-off events. [2024-02-20 12:45:58,779 INFO L125 PetriNetUnfolderBase]: For 2106/2408 co-relation queries the response was YES. [2024-02-20 12:45:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16901 conditions, 6382 events. 4200/6382 cut-off events. For 2106/2408 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 37752 event pairs, 427 based on Foata normal form. 45/6381 useless extension candidates. Maximal degree in co-relation 13631. Up to 4072 conditions per place. [2024-02-20 12:45:58,817 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 141 selfloop transitions, 10 changer transitions 2/161 dead transitions. [2024-02-20 12:45:58,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 161 transitions, 1038 flow [2024-02-20 12:45:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:45:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:45:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-20 12:45:58,821 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6930232558139535 [2024-02-20 12:45:58,822 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2024-02-20 12:45:58,822 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 161 transitions, 1038 flow [2024-02-20 12:45:58,822 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:45:58,822 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:45:58,823 INFO L234 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] [2024-02-20 12:45:58,823 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:45:58,825 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:45:58,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:45:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash -880196735, now seen corresponding path program 1 times [2024-02-20 12:45:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:45:58,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036511946] [2024-02-20 12:45:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:45:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:45:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:45:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:45:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:45:59,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036511946] [2024-02-20 12:45:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036511946] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:45:59,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:45:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:45:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816319736] [2024-02-20 12:45:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:45:59,054 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:45:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:45:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:45:59,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:45:59,067 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:45:59,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 161 transitions, 1038 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:45:59,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:45:59,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:45:59,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:45:59,906 INFO L124 PetriNetUnfolderBase]: 7249/10116 cut-off events. [2024-02-20 12:45:59,906 INFO L125 PetriNetUnfolderBase]: For 9655/11545 co-relation queries the response was YES. [2024-02-20 12:45:59,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36880 conditions, 10116 events. 7249/10116 cut-off events. For 9655/11545 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 58070 event pairs, 139 based on Foata normal form. 210/10169 useless extension candidates. Maximal degree in co-relation 34684. Up to 7099 conditions per place. [2024-02-20 12:45:59,978 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 350 selfloop transitions, 25 changer transitions 3/388 dead transitions. [2024-02-20 12:45:59,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 388 transitions, 3308 flow [2024-02-20 12:45:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:45:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:45:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-02-20 12:45:59,982 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7023255813953488 [2024-02-20 12:45:59,983 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2024-02-20 12:45:59,984 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 388 transitions, 3308 flow [2024-02-20 12:45:59,984 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:45:59,984 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:45:59,984 INFO L234 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] [2024-02-20 12:45:59,984 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:45:59,984 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:45:59,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:45:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1987751154, now seen corresponding path program 1 times [2024-02-20 12:45:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:45:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908316459] [2024-02-20 12:45:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:45:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:46:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:46:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:46:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:46:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908316459] [2024-02-20 12:46:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908316459] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:46:00,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:46:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:46:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679309776] [2024-02-20 12:46:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:46:00,170 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:46:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:46:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:46:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:46:00,182 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:46:00,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 388 transitions, 3308 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:46:00,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:46:00,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:46:00,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:02,413 INFO L124 PetriNetUnfolderBase]: 17725/24445 cut-off events. [2024-02-20 12:46:02,414 INFO L125 PetriNetUnfolderBase]: For 54517/58577 co-relation queries the response was YES. [2024-02-20 12:46:02,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102160 conditions, 24445 events. 17725/24445 cut-off events. For 54517/58577 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 143988 event pairs, 1430 based on Foata normal form. 1238/25161 useless extension candidates. Maximal degree in co-relation 99070. Up to 14873 conditions per place. [2024-02-20 12:46:02,611 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 794 selfloop transitions, 82 changer transitions 61/957 dead transitions. [2024-02-20 12:46:02,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 957 transitions, 10016 flow [2024-02-20 12:46:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:46:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:46:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-02-20 12:46:02,612 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6558139534883721 [2024-02-20 12:46:02,613 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2024-02-20 12:46:02,613 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 957 transitions, 10016 flow [2024-02-20 12:46:02,613 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:46:02,613 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:46:02,613 INFO L234 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] [2024-02-20 12:46:02,614 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 12:46:02,614 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:46:02,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:46:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2141541402, now seen corresponding path program 2 times [2024-02-20 12:46:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:46:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274807603] [2024-02-20 12:46:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:46:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:46:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:46:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:46:02,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:46:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274807603] [2024-02-20 12:46:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274807603] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:46:02,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:46:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:46:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430910201] [2024-02-20 12:46:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:46:02,856 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:46:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:46:02,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:46:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:46:02,885 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:46:02,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 957 transitions, 10016 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-20 12:46:02,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:46:02,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:46:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:05,489 INFO L124 PetriNetUnfolderBase]: 18374/25276 cut-off events. [2024-02-20 12:46:05,489 INFO L125 PetriNetUnfolderBase]: For 92938/98408 co-relation queries the response was YES. [2024-02-20 12:46:05,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125952 conditions, 25276 events. 18374/25276 cut-off events. For 92938/98408 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 147886 event pairs, 1114 based on Foata normal form. 880/25361 useless extension candidates. Maximal degree in co-relation 122337. Up to 18042 conditions per place. [2024-02-20 12:46:05,695 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 1112 selfloop transitions, 176 changer transitions 97/1401 dead transitions. [2024-02-20 12:46:05,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 1401 transitions, 17406 flow [2024-02-20 12:46:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:46:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:46:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-02-20 12:46:05,697 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2024-02-20 12:46:05,699 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2024-02-20 12:46:05,699 INFO L507 AbstractCegarLoop]: Abstraction has has 66 places, 1401 transitions, 17406 flow [2024-02-20 12:46:05,699 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-20 12:46:05,699 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:46:05,700 INFO L234 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] [2024-02-20 12:46:05,700 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:46:05,700 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:46:05,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:46:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash 708524734, now seen corresponding path program 2 times [2024-02-20 12:46:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:46:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973484469] [2024-02-20 12:46:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:46:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:46:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:46:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:46:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:46:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973484469] [2024-02-20 12:46:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973484469] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:46:05,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:46:05,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 12:46:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662575977] [2024-02-20 12:46:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:46:05,918 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 12:46:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:46:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 12:46:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-02-20 12:46:05,959 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:46:05,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 1401 transitions, 17406 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-02-20 12:46:05,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:46:05,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:46:05,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:10,665 INFO L124 PetriNetUnfolderBase]: 28884/40046 cut-off events. [2024-02-20 12:46:10,666 INFO L125 PetriNetUnfolderBase]: For 226488/237381 co-relation queries the response was YES. [2024-02-20 12:46:10,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230835 conditions, 40046 events. 28884/40046 cut-off events. For 226488/237381 co-relation queries the response was YES. Maximal size of possible extension queue 1851. Compared 251009 event pairs, 1032 based on Foata normal form. 2348/41499 useless extension candidates. Maximal degree in co-relation 224477. Up to 29881 conditions per place. [2024-02-20 12:46:11,133 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 1952 selfloop transitions, 365 changer transitions 185/2521 dead transitions. [2024-02-20 12:46:11,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 2521 transitions, 36309 flow [2024-02-20 12:46:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 12:46:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 12:46:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 230 transitions. [2024-02-20 12:46:11,135 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2024-02-20 12:46:11,138 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2024-02-20 12:46:11,139 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 2521 transitions, 36309 flow [2024-02-20 12:46:11,139 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-02-20 12:46:11,139 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:46:11,139 INFO L234 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] [2024-02-20 12:46:11,139 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 12:46:11,140 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:46:11,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:46:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 441283946, now seen corresponding path program 3 times [2024-02-20 12:46:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:46:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684845844] [2024-02-20 12:46:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:46:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:46:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:46:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:46:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:46:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684845844] [2024-02-20 12:46:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684845844] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:46:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:46:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:46:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544779282] [2024-02-20 12:46:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:46:11,385 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:46:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:46:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:46:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:46:11,422 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:46:11,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 2521 transitions, 36309 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-20 12:46:11,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:46:11,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:46:11,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:14,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][844], [113#true, 16#L66true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 35#L52true, 67#true, 58#true, 55#true]) [2024-02-20 12:46:14,258 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,258 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,258 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,259 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][847], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 29#L90true, 77#true, 88#true, 16#L66true, 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 19#L47true, 55#true]) [2024-02-20 12:46:14,259 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,259 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,259 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,259 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][832], [113#true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 67#true, 19#L47true, 58#true, 55#true]) [2024-02-20 12:46:14,260 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,260 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,260 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,261 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L112-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread4Thread1of1ForFork0_~cond~3_5 256) 0) (= |v_thread4Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} OutVars{thread4Thread1of1ForFork0_#res.base=|v_thread4Thread1of1ForFork0_#res.base_1|, thread4Thread1of1ForFork0_#res.offset=|v_thread4Thread1of1ForFork0_#res.offset_1|, thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork0_#res.offset][833], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 83#(and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0)), 110#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)), 16#L66true, 97#(and (= ~n2~0 ~n1~0) (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)), thread3Thread1of1ForFork2InUse, 57#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 34#thread4EXITtrue, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 124#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), thread1Thread1of1ForFork3InUse, 19#L47true]) [2024-02-20 12:46:14,505 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,505 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,505 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,505 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:14,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1216], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 33#L109true, 77#true, 16#L66true, 88#true, 100#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 19#L47true, 55#true]) [2024-02-20 12:46:14,506 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:46:14,506 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:14,506 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:14,506 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:20,625 INFO L124 PetriNetUnfolderBase]: 36709/52140 cut-off events. [2024-02-20 12:46:20,625 INFO L125 PetriNetUnfolderBase]: For 399307/414283 co-relation queries the response was YES. [2024-02-20 12:46:20,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341434 conditions, 52140 events. 36709/52140 cut-off events. For 399307/414283 co-relation queries the response was YES. Maximal size of possible extension queue 2453. Compared 357385 event pairs, 1295 based on Foata normal form. 2159/53306 useless extension candidates. Maximal degree in co-relation 331679. Up to 38008 conditions per place. [2024-02-20 12:46:21,177 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 3504 selfloop transitions, 375 changer transitions 258/4156 dead transitions. [2024-02-20 12:46:21,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 4156 transitions, 68439 flow [2024-02-20 12:46:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 12:46:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 12:46:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2024-02-20 12:46:21,178 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-02-20 12:46:21,179 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2024-02-20 12:46:21,179 INFO L507 AbstractCegarLoop]: Abstraction has has 79 places, 4156 transitions, 68439 flow [2024-02-20 12:46:21,179 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-20 12:46:21,179 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:46:21,179 INFO L234 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] [2024-02-20 12:46:21,180 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 12:46:21,180 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:46:21,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:46:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374194, now seen corresponding path program 3 times [2024-02-20 12:46:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:46:21,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101460910] [2024-02-20 12:46:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:46:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:46:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:46:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:46:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:46:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101460910] [2024-02-20 12:46:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101460910] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:46:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:46:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 12:46:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936126612] [2024-02-20 12:46:21,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:46:21,553 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 12:46:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:46:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 12:46:21,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-20 12:46:21,584 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:46:21,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 4156 transitions, 68439 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-02-20 12:46:21,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:46:21,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:46:21,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:25,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][880], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 29#L90true, 16#L66true, 77#true, 88#true, 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:25,949 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][883], [113#true, 88#true, 16#L66true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 67#true, 35#L52true, 58#true, 127#true, 55#true]) [2024-02-20 12:46:25,949 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,949 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][889], [113#true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 67#true, 58#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:25,954 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:25,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:26,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1295], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 33#L109true, 88#true, 77#true, 16#L66true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:26,103 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:46:26,103 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:26,103 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:26,103 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:27,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L112-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread4Thread1of1ForFork0_~cond~3_5 256) 0) (= |v_thread4Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} OutVars{thread4Thread1of1ForFork0_#res.base=|v_thread4Thread1of1ForFork0_#res.base_1|, thread4Thread1of1ForFork0_#res.offset=|v_thread4Thread1of1ForFork0_#res.offset_1|, thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork0_#res.offset][891], [130#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)))), 60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 83#(and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0)), 110#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)), 16#L66true, 97#(and (= ~n2~0 ~n1~0) (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)), thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, 57#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), thread2Thread1of1ForFork1InUse, 34#thread4EXITtrue, 25#L85true, thread4Thread1of1ForFork0InUse, 124#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), thread1Thread1of1ForFork3InUse, 19#L47true]) [2024-02-20 12:46:27,790 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-02-20 12:46:27,790 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-20 12:46:27,790 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-20 12:46:27,790 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-20 12:46:36,213 INFO L124 PetriNetUnfolderBase]: 37542/53835 cut-off events. [2024-02-20 12:46:36,213 INFO L125 PetriNetUnfolderBase]: For 544821/562640 co-relation queries the response was YES. [2024-02-20 12:46:36,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396573 conditions, 53835 events. 37542/53835 cut-off events. For 544821/562640 co-relation queries the response was YES. Maximal size of possible extension queue 2597. Compared 378069 event pairs, 1165 based on Foata normal form. 2285/55105 useless extension candidates. Maximal degree in co-relation 384543. Up to 38672 conditions per place. [2024-02-20 12:46:36,745 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 3895 selfloop transitions, 386 changer transitions 337/4646 dead transitions. [2024-02-20 12:46:36,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 4646 transitions, 85875 flow [2024-02-20 12:46:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:46:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:46:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-02-20 12:46:36,746 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2024-02-20 12:46:36,747 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2024-02-20 12:46:36,747 INFO L507 AbstractCegarLoop]: Abstraction has has 84 places, 4646 transitions, 85875 flow [2024-02-20 12:46:36,747 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-02-20 12:46:36,747 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:46:36,747 INFO L234 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] [2024-02-20 12:46:36,748 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 12:46:36,748 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:46:36,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:46:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 382885553, now seen corresponding path program 1 times [2024-02-20 12:46:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:46:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502630535] [2024-02-20 12:46:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:46:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:46:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:46:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:46:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:46:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502630535] [2024-02-20 12:46:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502630535] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:46:36,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:46:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:46:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414119145] [2024-02-20 12:46:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:46:36,872 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:46:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:46:36,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:46:36,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:46:36,884 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:46:36,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 4646 transitions, 85875 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:46:36,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:46:36,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:46:36,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:41,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L132-4-->L133-1: Formula: (= (select (select |v_#memory_int#2_8| |v_ULTIMATE.start_main_~#t1~0#1.base_90|) |v_ULTIMATE.start_main_~#t1~0#1.offset_72|) |v_ULTIMATE.start_main_#t~mem16#1_49|) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_90|, #memory_int#2=|v_#memory_int#2_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_72|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_58|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_49|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_90|, #memory_int#2=|v_#memory_int#2_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_72|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1][2253], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 30#L93true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 13#L74true, 127#true, 55#true, 23#L55true]) [2024-02-20 12:46:41,041 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,041 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L55-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork3_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork3_#res.offset_1| 0) (= 0 |v_thread1Thread1of1ForFork3_#res.base_1|)) InVars {thread1Thread1of1ForFork3_~cond~0=v_thread1Thread1of1ForFork3_~cond~0_5} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_1|, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_1|, thread1Thread1of1ForFork3_~cond~0=v_thread1Thread1of1ForFork3_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_#res.offset][2249], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 30#L93true, 113#true, 73#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, thread2Thread1of1ForFork1InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 12#thread1EXITtrue, 13#L74true, 22#L132-4true, 127#true, 55#true]) [2024-02-20 12:46:41,042 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L74-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][2251], [30#L93true, 113#true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 6#thread2EXITtrue, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 22#L132-4true, 64#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), 127#true, 55#true, 23#L55true]) [2024-02-20 12:46:41,042 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,042 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0) (= 0 (mod v_thread3Thread1of1ForFork2_~cond~2_5 256))) InVars {thread3Thread1of1ForFork2_~cond~2=v_thread3Thread1of1ForFork2_~cond~2_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~cond~2=v_thread3Thread1of1ForFork2_~cond~2_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][2252], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 28#thread3EXITtrue, 22#L132-4true, 13#L74true, 127#true, 144#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)), 55#true, 23#L55true]) [2024-02-20 12:46:41,236 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,236 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,236 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,236 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L112-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread4Thread1of1ForFork0_~cond~3_5 256) 0) (= |v_thread4Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} OutVars{thread4Thread1of1ForFork0_#res.base=|v_thread4Thread1of1ForFork0_#res.base_1|, thread4Thread1of1ForFork0_#res.offset=|v_thread4Thread1of1ForFork0_#res.offset_1|, thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork0_#res.offset][2250], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 30#L93true, 113#true, 83#(and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0)), 88#true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, 34#thread4EXITtrue, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 22#L132-4true, 13#L74true, 127#true, 23#L55true, 55#true]) [2024-02-20 12:46:41,238 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,238 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,238 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:41,238 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-20 12:46:42,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1003], [113#true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 67#true, 58#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:42,996 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,996 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,996 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,996 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][1009], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 29#L90true, 16#L66true, 77#true, 88#true, 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:42,996 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,996 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,997 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,997 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][998], [113#true, 16#L66true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 67#true, 35#L52true, 58#true, 127#true, 55#true]) [2024-02-20 12:46:42,997 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,997 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,997 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:42,997 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L132-4-->L133-1: Formula: (= (select (select |v_#memory_int#2_8| |v_ULTIMATE.start_main_~#t1~0#1.base_90|) |v_ULTIMATE.start_main_~#t1~0#1.offset_72|) |v_ULTIMATE.start_main_#t~mem16#1_49|) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_90|, #memory_int#2=|v_#memory_int#2_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_72|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_58|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_49|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_90|, #memory_int#2=|v_#memory_int#2_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_72|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1][2253], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 30#L93true, 9#L104true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 100#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 13#L74true, 127#true, 23#L55true, 55#true]) [2024-02-20 12:46:43,385 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L55-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork3_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork3_#res.offset_1| 0) (= 0 |v_thread1Thread1of1ForFork3_#res.base_1|)) InVars {thread1Thread1of1ForFork3_~cond~0=v_thread1Thread1of1ForFork3_~cond~0_5} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_1|, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_1|, thread1Thread1of1ForFork3_~cond~0=v_thread1Thread1of1ForFork3_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_#res.offset][2249], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 30#L93true, 9#L104true, 73#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 100#true, thread3Thread1of1ForFork2InUse, thread2Thread1of1ForFork1InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 12#thread1EXITtrue, 13#L74true, 22#L132-4true, 127#true, 55#true]) [2024-02-20 12:46:43,386 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L74-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][2251], [113#true, 30#L93true, 9#L104true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 6#thread2EXITtrue, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 64#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), 22#L132-4true, 127#true, 55#true, 23#L55true]) [2024-02-20 12:46:43,386 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][3098], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 30#L93true, 113#true, 33#L109true, 77#true, 88#true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 13#L74true, 22#L132-4true, 127#true, 55#true, 23#L55true]) [2024-02-20 12:46:43,387 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,387 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,387 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,387 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0) (= 0 (mod v_thread3Thread1of1ForFork2_~cond~2_5 256))) InVars {thread3Thread1of1ForFork2_~cond~2=v_thread3Thread1of1ForFork2_~cond~2_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~cond~2=v_thread3Thread1of1ForFork2_~cond~2_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][2252], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 9#L104true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 28#thread3EXITtrue, 22#L132-4true, 13#L74true, 127#true, 144#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)), 55#true, 23#L55true]) [2024-02-20 12:46:43,630 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,631 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,631 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:43,631 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:46:45,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L112-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread4Thread1of1ForFork0_~cond~3_5 256) 0) (= |v_thread4Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} OutVars{thread4Thread1of1ForFork0_#res.base=|v_thread4Thread1of1ForFork0_#res.base_1|, thread4Thread1of1ForFork0_#res.offset=|v_thread4Thread1of1ForFork0_#res.offset_1|, thread4Thread1of1ForFork0_~cond~3=v_thread4Thread1of1ForFork0_~cond~3_5} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork0_#res.offset][1012], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 130#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)))), 83#(and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0)), 110#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)), 16#L66true, 97#(and (= ~n2~0 ~n1~0) (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)), thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, 57#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), thread2Thread1of1ForFork1InUse, 34#thread4EXITtrue, 25#L85true, thread4Thread1of1ForFork0InUse, 124#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 19#L47true]) [2024-02-20 12:46:45,834 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-02-20 12:46:45,834 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-20 12:46:45,834 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-20 12:46:45,834 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-20 12:46:45,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1003], [113#true, 9#L104true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 67#true, 58#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:45,839 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1552], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 33#L109true, 88#true, 16#L66true, 77#true, 100#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:45,839 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][1009], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 9#L104true, 29#L90true, 88#true, 16#L66true, 77#true, 100#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:46:45,839 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][998], [113#true, 9#L104true, 88#true, 16#L66true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread1Thread1of1ForFork3InUse, 67#true, 35#L52true, 58#true, 127#true, 55#true]) [2024-02-20 12:46:45,839 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,840 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,840 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:46:45,840 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:04,538 INFO L124 PetriNetUnfolderBase]: 55003/76352 cut-off events. [2024-02-20 12:47:04,538 INFO L125 PetriNetUnfolderBase]: For 1015306/1062288 co-relation queries the response was YES. [2024-02-20 12:47:04,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633845 conditions, 76352 events. 55003/76352 cut-off events. For 1015306/1062288 co-relation queries the response was YES. Maximal size of possible extension queue 3602. Compared 523660 event pairs, 1322 based on Foata normal form. 4903/79232 useless extension candidates. Maximal degree in co-relation 615243. Up to 56484 conditions per place. [2024-02-20 12:47:05,332 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 6498 selfloop transitions, 664 changer transitions 966/8195 dead transitions. [2024-02-20 12:47:05,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 8195 transitions, 168556 flow [2024-02-20 12:47:05,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:47:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:47:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-02-20 12:47:05,333 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6651162790697674 [2024-02-20 12:47:05,334 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2024-02-20 12:47:05,334 INFO L507 AbstractCegarLoop]: Abstraction has has 88 places, 8195 transitions, 168556 flow [2024-02-20 12:47:05,334 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:47:05,334 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:47:05,334 INFO L234 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] [2024-02-20 12:47:05,334 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 12:47:05,334 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:47:05,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:47:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -342193637, now seen corresponding path program 2 times [2024-02-20 12:47:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:47:05,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120839464] [2024-02-20 12:47:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:47:05,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:47:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:47:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:47:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:47:05,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120839464] [2024-02-20 12:47:05,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120839464] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:47:05,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:47:05,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 12:47:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41888660] [2024-02-20 12:47:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:47:05,455 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:47:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:47:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:47:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:47:05,463 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-02-20 12:47:05,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 8195 transitions, 168556 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-02-20 12:47:05,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:47:05,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-02-20 12:47:05,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:47:19,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][1100], [113#true, 16#L66true, 88#true, 3#L112true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 35#L52true, 67#true, 58#true, 127#true, 55#true]) [2024-02-20 12:47:19,954 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][1110], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 29#L90true, 77#true, 88#true, 16#L66true, 3#L112true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:19,954 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1098], [113#true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 58#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:19,954 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,954 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1126], [113#true, 30#L93true, 9#L104true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 58#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:19,987 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,987 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,987 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,987 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1125], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 30#L93true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 33#L109true, 88#true, 77#true, 16#L66true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:19,988 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][1135], [113#true, 30#L93true, 9#L104true, 88#true, 16#L66true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 35#L52true, 67#true, 58#true, 127#true, 55#true]) [2024-02-20 12:47:19,988 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:19,988 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:47:28,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][1100], [113#true, 9#L104true, 88#true, 16#L66true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 35#L52true, 58#true, 127#true, 55#true]) [2024-02-20 12:47:28,486 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,486 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,486 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,486 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1874], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 33#L109true, 77#true, 16#L66true, 88#true, 100#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:28,487 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][1110], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 9#L104true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 29#L90true, 77#true, 16#L66true, 88#true, 100#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:28,487 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1098], [113#true, 9#L104true, 18#L71true, 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 58#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:47:28,487 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:47:28,487 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:48:41,513 INFO L124 PetriNetUnfolderBase]: 83004/115533 cut-off events. [2024-02-20 12:48:41,514 INFO L125 PetriNetUnfolderBase]: For 1718516/1783118 co-relation queries the response was YES. [2024-02-20 12:48:41,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055223 conditions, 115533 events. 83004/115533 cut-off events. For 1718516/1783118 co-relation queries the response was YES. Maximal size of possible extension queue 5425. Compared 834961 event pairs, 1738 based on Foata normal form. 10998/123789 useless extension candidates. Maximal degree in co-relation 1026970. Up to 86127 conditions per place. [2024-02-20 12:48:42,892 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 12498 selfloop transitions, 1008 changer transitions 1293/14851 dead transitions. [2024-02-20 12:48:42,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 14851 transitions, 335106 flow [2024-02-20 12:48:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 12:48:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 12:48:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-02-20 12:48:42,893 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6810631229235881 [2024-02-20 12:48:42,893 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2024-02-20 12:48:42,893 INFO L507 AbstractCegarLoop]: Abstraction has has 94 places, 14851 transitions, 335106 flow [2024-02-20 12:48:42,894 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-02-20 12:48:42,894 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:48:42,894 INFO L234 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] [2024-02-20 12:48:42,894 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 12:48:42,894 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 12:48:42,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:48:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -682054569, now seen corresponding path program 3 times [2024-02-20 12:48:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:48:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706591404] [2024-02-20 12:48:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:48:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:48:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:48:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:48:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:48:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706591404] [2024-02-20 12:48:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706591404] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:48:43,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:48:43,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:48:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580932005] [2024-02-20 12:48:43,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:48:43,014 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:48:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:48:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:48:43,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:48:43,026 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-02-20 12:48:43,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 14851 transitions, 335106 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:48:43,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:48:43,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-02-20 12:48:43,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:49:28,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][1099], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 29#L90true, 77#true, 88#true, 16#L66true, 3#L112true, 100#true, 158#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:49:28,134 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][1097], [113#true, 161#(and (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 88#true, 16#L66true, 3#L112true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 35#L52true, 67#true, 58#true, 127#true, 55#true]) [2024-02-20 12:49:28,134 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,134 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1101], [113#true, 18#L71true, 161#(and (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 3#L112true, 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 19#L47true, 58#true, 127#true, 55#true]) [2024-02-20 12:49:28,135 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,135 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,135 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,135 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1112], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 30#L93true, 113#true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 33#L109true, 77#true, 16#L66true, 88#true, 100#true, 158#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:49:28,224 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][1117], [30#L93true, 113#true, 9#L104true, 161#(and (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 88#true, 16#L66true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 35#L52true, 58#true, 127#true, 55#true]) [2024-02-20 12:49:28,224 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1120], [30#L93true, 113#true, 9#L104true, 18#L71true, 161#(and (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 19#L47true, 58#true, 127#true, 55#true]) [2024-02-20 12:49:28,224 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,224 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,225 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:28,225 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-20 12:49:53,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L85-->L90: Formula: (or (and (= v_~p2~0_97 (+ v_~m~0_83 v_~p2~0_98)) (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87)) (and (= |v_thread3Thread1of1ForFork2_#t~post2_2| |v_thread3Thread1of1ForFork2_#t~post2_1|) (= v_~p2~0_98 v_~p2~0_97) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_83, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork2_#t~post2][1099], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 9#L104true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 29#L90true, 77#true, 88#true, 16#L66true, 100#true, 158#true, thread3Thread1of1ForFork2InUse, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 5#L133-1true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:49:53,240 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L104-->L109: Formula: (or (and (= v_~n2~0_79 v_~n2~0_78) (= v_~p2~0_89 v_~p2~0_90) (<= v_~n2~0_79 1)) (and (= v_~n2~0_79 (+ v_~n2~0_78 2)) (< 1 v_~n2~0_79) (= (+ v_~p2~0_90 (* v_~m~0_79 2)) v_~p2~0_89))) InVars {~p2~0=v_~p2~0_90, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_79} OutVars{~p2~0=v_~p2~0_89, ~m~0=v_~m~0_79, ~n2~0=v_~n2~0_78} AuxVars[] AssignedVars[~n2~0, ~p2~0][1881], [60#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 113#true, 154#(and (<= 1 thread3Thread1of1ForFork2_~cond~2) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0)), 33#L109true, 77#true, 88#true, 16#L66true, 100#true, 158#true, thread3Thread1of1ForFork2InUse, 5#L133-1true, 69#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), thread2Thread1of1ForFork1InUse, 25#L85true, thread4Thread1of1ForFork0InUse, thread1Thread1of1ForFork3InUse, 138#true, 19#L47true, 127#true, 55#true]) [2024-02-20 12:49:53,240 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L47-->L52: Formula: (or (and (= v_~n1~0_82 v_~n1~0_83) (= |v_thread1Thread1of1ForFork3_#t~post1_2| |v_thread1Thread1of1ForFork3_#t~post1_1|) (= v_~p1~0_98 v_~p1~0_97) (<= v_~n1~0_83 0)) (and (= v_~n1~0_83 (+ v_~n1~0_82 1)) (< 0 v_~n1~0_83) (= (+ v_~m~0_71 v_~p1~0_98) v_~p1~0_97))) InVars {thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_1|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_98, ~n1~0=v_~n1~0_83} OutVars{thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_2|, ~m~0=v_~m~0_71, ~p1~0=v_~p1~0_97, ~n1~0=v_~n1~0_82} AuxVars[] AssignedVars[~p1~0, ~n1~0, thread1Thread1of1ForFork3_#t~post1][1097], [113#true, 9#L104true, 161#(and (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 88#true, 16#L66true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 35#L52true, 67#true, 58#true, 127#true, 55#true]) [2024-02-20 12:49:53,240 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,240 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([382] L66-->L71: Formula: (or (and (= v_~p1~0_105 v_~p1~0_106) (<= v_~n1~0_91 1) (= v_~n1~0_91 v_~n1~0_90)) (and (= v_~p1~0_105 (+ (* v_~m~0_75 2) v_~p1~0_106)) (= (+ v_~n1~0_90 2) v_~n1~0_91) (< 1 v_~n1~0_91))) InVars {~m~0=v_~m~0_75, ~p1~0=v_~p1~0_106, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_75, ~p1~0=v_~p1~0_105, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, ~n1~0][1101], [113#true, 9#L104true, 18#L71true, 161#(and (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0)))), 88#true, 79#(or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork0_~cond~3 0))), 105#(<= 1 ~n2~0), thread3Thread1of1ForFork2InUse, 5#L133-1true, thread2Thread1of1ForFork1InUse, 25#L85true, 140#(or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork2_~cond~2 0)) (and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0))), thread4Thread1of1ForFork0InUse, 156#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 ~n2~0) (= thread4Thread1of1ForFork0_~cond~3 1)), thread1Thread1of1ForFork3InUse, 67#true, 19#L47true, 58#true, 127#true, 55#true]) [2024-02-20 12:49:53,241 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,241 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,241 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-20 12:49:53,241 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event