./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:09:57,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:09:57,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:09:57,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:09:57,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:09:57,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:09:57,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:09:57,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:09:57,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:09:57,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:09:57,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:09:57,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:09:57,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:09:57,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:09:57,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:09:57,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:09:57,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:09:57,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:09:57,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:09:57,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:09:57,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:09:57,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-04-30 10:09:58,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:09:58,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:09:58,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:09:58,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:09:58,167 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:09:58,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-30 10:09:59,461 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b4e2f41/9df65eff46c441a1b8cecb3e16bb87e2/FLAGf36c046f3 [2025-04-30 10:09:59,755 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:09:59,758 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-30 10:09:59,778 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b4e2f41/9df65eff46c441a1b8cecb3e16bb87e2/FLAGf36c046f3 [2025-04-30 10:10:00,511 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b4e2f41/9df65eff46c441a1b8cecb3e16bb87e2 [2025-04-30 10:10:00,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:10:00,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:10:00,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:10:00,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:10:00,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:10:00,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e45ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00, skipping insertion in model container [2025-04-30 10:10:00,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:10:00,694 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-04-30 10:10:00,813 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:10:00,822 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:10:00,836 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-04-30 10:10:00,863 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:10:00,885 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:10:00,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00 WrapperNode [2025-04-30 10:10:00,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:10:00,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:10:00,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:10:00,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:10:00,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,917 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-04-30 10:10:00,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:10:00,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:10:00,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:10:00,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:10:00,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,933 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-04-30 10:10:00,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:10:00,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:10:00,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:10:00,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:10:00,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (1/1) ... [2025-04-30 10:10:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:10:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:10:00,974 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) [2025-04-30 10:10:00,976 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 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-30 10:10:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:10:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:10:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:10:00,991 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:10:01,081 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:10:01,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:10:01,238 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:10:01,238 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:10:01,337 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:10:01,337 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:10:01,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:10:01 BoogieIcfgContainer [2025-04-30 10:10:01,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:10:01,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:10:01,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:10:01,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:10:01,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:10:00" (1/3) ... [2025-04-30 10:10:01,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56efcd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:10:01, skipping insertion in model container [2025-04-30 10:10:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:10:00" (2/3) ... [2025-04-30 10:10:01,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56efcd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:10:01, skipping insertion in model container [2025-04-30 10:10:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:10:01" (3/3) ... [2025-04-30 10:10:01,344 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-30 10:10:01,354 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:10:01,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 36 edges, 1 initial locations, 3 loop locations, and 2 error locations. [2025-04-30 10:10:01,355 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:10:01,389 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:10:01,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-04-30 10:10:01,437 INFO L116 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-04-30 10:10:01,439 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:10:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 7/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-30 10:10:01,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-04-30 10:10:01,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-04-30 10:10:01,450 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:10:01,468 INFO L340 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@532be784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:10:01,469 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:10:01,479 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:10:01,482 INFO L116 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-04-30 10:10:01,482 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:10:01,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:01,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:01,483 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:01,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:01,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1293738985, now seen corresponding path program 1 times [2025-04-30 10:10:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:01,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513687907] [2025-04-30 10:10:01,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:01,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:10:01,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:10:01,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:01,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:01,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513687907] [2025-04-30 10:10:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513687907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:10:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326146743] [2025-04-30 10:10:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:01,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:10:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:01,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:10:01,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:10:01,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-30 10:10:01,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2025-04-30 10:10:01,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:01,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-30 10:10:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:01,758 INFO L116 PetriNetUnfolderBase]: 102/244 cut-off events. [2025-04-30 10:10:01,759 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:10:01,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 244 events. 102/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 944 event pairs, 66 based on Foata normal form. 21/221 useless extension candidates. Maximal degree in co-relation 421. Up to 182 conditions per place. [2025-04-30 10:10:01,763 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 21 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-04-30 10:10:01,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 109 flow [2025-04-30 10:10:01,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:10:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-30 10:10:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2025-04-30 10:10:01,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2025-04-30 10:10:01,774 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 2 states and 49 transitions. [2025-04-30 10:10:01,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 109 flow [2025-04-30 10:10:01,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:10:01,779 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 66 flow [2025-04-30 10:10:01,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-04-30 10:10:01,785 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2025-04-30 10:10:01,785 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 66 flow [2025-04-30 10:10:01,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2025-04-30 10:10:01,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:01,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:01,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:10:01,787 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:01,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1293770763, now seen corresponding path program 1 times [2025-04-30 10:10:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:01,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261853990] [2025-04-30 10:10:01,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:01,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:10:01,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:10:01,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:01,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:02,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261853990] [2025-04-30 10:10:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261853990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:10:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927565802] [2025-04-30 10:10:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:02,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:10:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:02,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:10:02,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:10:02,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:02,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:10:02,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:02,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:02,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:02,267 INFO L116 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-04-30 10:10:02,267 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:10:02,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 450 events. 218/450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1938 event pairs, 20 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 857. Up to 241 conditions per place. [2025-04-30 10:10:02,269 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-04-30 10:10:02,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 264 flow [2025-04-30 10:10:02,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:10:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:10:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-30 10:10:02,272 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-04-30 10:10:02,272 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 66 flow. Second operand 6 states and 112 transitions. [2025-04-30 10:10:02,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 264 flow [2025-04-30 10:10:02,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:10:02,274 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 168 flow [2025-04-30 10:10:02,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2025-04-30 10:10:02,276 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-04-30 10:10:02,277 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 168 flow [2025-04-30 10:10:02,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:10:02,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:02,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:02,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:10:02,279 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:02,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1452153518, now seen corresponding path program 1 times [2025-04-30 10:10:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:02,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040700922] [2025-04-30 10:10:02,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:02,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:10:02,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:10:02,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:02,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:02,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040700922] [2025-04-30 10:10:02,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040700922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:02,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:02,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:10:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600924485] [2025-04-30 10:10:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:02,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:10:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:02,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:10:02,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:10:02,383 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-30 10:10:02,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2025-04-30 10:10:02,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:02,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-30 10:10:02,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:02,547 INFO L116 PetriNetUnfolderBase]: 278/559 cut-off events. [2025-04-30 10:10:02,547 INFO L117 PetriNetUnfolderBase]: For 184/186 co-relation queries the response was YES. [2025-04-30 10:10:02,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 559 events. 278/559 cut-off events. For 184/186 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2463 event pairs, 60 based on Foata normal form. 20/538 useless extension candidates. Maximal degree in co-relation 1390. Up to 303 conditions per place. [2025-04-30 10:10:02,554 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-04-30 10:10:02,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 474 flow [2025-04-30 10:10:02,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:10:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:10:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-04-30 10:10:02,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-04-30 10:10:02,555 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-04-30 10:10:02,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 474 flow [2025-04-30 10:10:02,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:10:02,559 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 366 flow [2025-04-30 10:10:02,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2025-04-30 10:10:02,559 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-04-30 10:10:02,559 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 366 flow [2025-04-30 10:10:02,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2025-04-30 10:10:02,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:02,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:02,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:10:02,560 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:02,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2136376707, now seen corresponding path program 1 times [2025-04-30 10:10:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:02,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589666300] [2025-04-30 10:10:02,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:02,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:10:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:10:02,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:02,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:02,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589666300] [2025-04-30 10:10:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589666300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:10:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056798098] [2025-04-30 10:10:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:02,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:10:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:10:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:10:02,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-30 10:10:02,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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) [2025-04-30 10:10:02,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:02,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-30 10:10:02,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:03,077 INFO L116 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-04-30 10:10:03,078 INFO L117 PetriNetUnfolderBase]: For 1254/1271 co-relation queries the response was YES. [2025-04-30 10:10:03,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 859 events. 399/859 cut-off events. For 1254/1271 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4776 event pairs, 86 based on Foata normal form. 16/819 useless extension candidates. Maximal degree in co-relation 2730. Up to 360 conditions per place. [2025-04-30 10:10:03,083 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-04-30 10:10:03,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 942 flow [2025-04-30 10:10:03,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:10:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:10:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-04-30 10:10:03,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-04-30 10:10:03,085 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-04-30 10:10:03,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 942 flow [2025-04-30 10:10:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:10:03,093 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 588 flow [2025-04-30 10:10:03,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2025-04-30 10:10:03,094 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2025-04-30 10:10:03,094 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 588 flow [2025-04-30 10:10:03,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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) [2025-04-30 10:10:03,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:03,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:03,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:10:03,094 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:03,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -566574497, now seen corresponding path program 2 times [2025-04-30 10:10:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:03,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566326921] [2025-04-30 10:10:03,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:10:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:03,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:10:03,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:10:03,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:10:03,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:03,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566326921] [2025-04-30 10:10:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566326921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:03,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:10:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063238944] [2025-04-30 10:10:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:03,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:10:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:03,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:10:03,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:10:03,526 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:03,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:03,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:03,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:03,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:03,903 INFO L116 PetriNetUnfolderBase]: 468/945 cut-off events. [2025-04-30 10:10:03,903 INFO L117 PetriNetUnfolderBase]: For 1991/2022 co-relation queries the response was YES. [2025-04-30 10:10:03,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 945 events. 468/945 cut-off events. For 1991/2022 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4965 event pairs, 99 based on Foata normal form. 32/971 useless extension candidates. Maximal degree in co-relation 3452. Up to 583 conditions per place. [2025-04-30 10:10:03,910 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 67 selfloop transitions, 61 changer transitions 0/136 dead transitions. [2025-04-30 10:10:03,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 136 transitions, 1241 flow [2025-04-30 10:10:03,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:10:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:10:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2025-04-30 10:10:03,916 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4074844074844075 [2025-04-30 10:10:03,916 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 588 flow. Second operand 13 states and 196 transitions. [2025-04-30 10:10:03,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 136 transitions, 1241 flow [2025-04-30 10:10:03,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 136 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:10:03,927 INFO L231 Difference]: Finished difference. Result has 74 places, 108 transitions, 999 flow [2025-04-30 10:10:03,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=999, PETRI_PLACES=74, PETRI_TRANSITIONS=108} [2025-04-30 10:10:03,928 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 41 predicate places. [2025-04-30 10:10:03,928 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 108 transitions, 999 flow [2025-04-30 10:10:03,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:03,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:03,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:03,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:10:03,929 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:03,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1416755997, now seen corresponding path program 3 times [2025-04-30 10:10:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:03,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57443921] [2025-04-30 10:10:03,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:10:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:03,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:10:03,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:10:03,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:10:03,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:04,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57443921] [2025-04-30 10:10:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57443921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:04,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:10:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730016245] [2025-04-30 10:10:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:04,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:10:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:04,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:10:04,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:10:04,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-30 10:10:04,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 108 transitions, 999 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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) [2025-04-30 10:10:04,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:04,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-30 10:10:04,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:04,333 INFO L116 PetriNetUnfolderBase]: 550/1189 cut-off events. [2025-04-30 10:10:04,333 INFO L117 PetriNetUnfolderBase]: For 3280/3304 co-relation queries the response was YES. [2025-04-30 10:10:04,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4670 conditions, 1189 events. 550/1189 cut-off events. For 3280/3304 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7031 event pairs, 170 based on Foata normal form. 16/1202 useless extension candidates. Maximal degree in co-relation 4650. Up to 592 conditions per place. [2025-04-30 10:10:04,341 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 116 selfloop transitions, 42 changer transitions 0/173 dead transitions. [2025-04-30 10:10:04,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 173 transitions, 1724 flow [2025-04-30 10:10:04,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:10:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:10:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-04-30 10:10:04,342 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-04-30 10:10:04,342 INFO L175 Difference]: Start difference. First operand has 74 places, 108 transitions, 999 flow. Second operand 7 states and 166 transitions. [2025-04-30 10:10:04,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 173 transitions, 1724 flow [2025-04-30 10:10:04,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 173 transitions, 1640 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-30 10:10:04,355 INFO L231 Difference]: Finished difference. Result has 79 places, 115 transitions, 1110 flow [2025-04-30 10:10:04,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1110, PETRI_PLACES=79, PETRI_TRANSITIONS=115} [2025-04-30 10:10:04,356 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2025-04-30 10:10:04,356 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 115 transitions, 1110 flow [2025-04-30 10:10:04,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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) [2025-04-30 10:10:04,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:04,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:04,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:10:04,356 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:04,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1307763121, now seen corresponding path program 4 times [2025-04-30 10:10:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:04,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579400836] [2025-04-30 10:10:04,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:10:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:04,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-30 10:10:04,368 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-04-30 10:10:04,368 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:10:04,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:04,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579400836] [2025-04-30 10:10:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579400836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:10:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901016659] [2025-04-30 10:10:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:04,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:10:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:04,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:10:04,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:10:04,428 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-30 10:10:04,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 115 transitions, 1110 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2025-04-30 10:10:04,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:04,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-30 10:10:04,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:04,683 INFO L116 PetriNetUnfolderBase]: 761/1567 cut-off events. [2025-04-30 10:10:04,683 INFO L117 PetriNetUnfolderBase]: For 5246/5360 co-relation queries the response was YES. [2025-04-30 10:10:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 1567 events. 761/1567 cut-off events. For 5246/5360 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9552 event pairs, 16 based on Foata normal form. 80/1646 useless extension candidates. Maximal degree in co-relation 6424. Up to 400 conditions per place. [2025-04-30 10:10:04,692 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 209 selfloop transitions, 33 changer transitions 0/260 dead transitions. [2025-04-30 10:10:04,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 260 transitions, 2857 flow [2025-04-30 10:10:04,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:10:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:10:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-04-30 10:10:04,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-04-30 10:10:04,693 INFO L175 Difference]: Start difference. First operand has 79 places, 115 transitions, 1110 flow. Second operand 7 states and 168 transitions. [2025-04-30 10:10:04,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 260 transitions, 2857 flow [2025-04-30 10:10:04,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 260 transitions, 2711 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-04-30 10:10:04,707 INFO L231 Difference]: Finished difference. Result has 82 places, 137 transitions, 1193 flow [2025-04-30 10:10:04,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1193, PETRI_PLACES=82, PETRI_TRANSITIONS=137} [2025-04-30 10:10:04,708 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 49 predicate places. [2025-04-30 10:10:04,708 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 137 transitions, 1193 flow [2025-04-30 10:10:04,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2025-04-30 10:10:04,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:04,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:04,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:10:04,708 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:04,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 594447617, now seen corresponding path program 5 times [2025-04-30 10:10:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:04,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673957413] [2025-04-30 10:10:04,709 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:10:04,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:04,718 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:10:04,725 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:10:04,725 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:10:04,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:04,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673957413] [2025-04-30 10:10:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673957413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:04,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:10:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704058466] [2025-04-30 10:10:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:04,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:10:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:04,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:10:04,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:10:04,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:04,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 137 transitions, 1193 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:04,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:04,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:04,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:05,353 INFO L116 PetriNetUnfolderBase]: 865/1758 cut-off events. [2025-04-30 10:10:05,354 INFO L117 PetriNetUnfolderBase]: For 4950/5010 co-relation queries the response was YES. [2025-04-30 10:10:05,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7643 conditions, 1758 events. 865/1758 cut-off events. For 4950/5010 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10148 event pairs, 195 based on Foata normal form. 65/1811 useless extension candidates. Maximal degree in co-relation 7619. Up to 1228 conditions per place. [2025-04-30 10:10:05,365 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 102 selfloop transitions, 62 changer transitions 0/173 dead transitions. [2025-04-30 10:10:05,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 173 transitions, 1693 flow [2025-04-30 10:10:05,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:10:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:10:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2025-04-30 10:10:05,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42792792792792794 [2025-04-30 10:10:05,366 INFO L175 Difference]: Start difference. First operand has 82 places, 137 transitions, 1193 flow. Second operand 12 states and 190 transitions. [2025-04-30 10:10:05,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 173 transitions, 1693 flow [2025-04-30 10:10:05,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 173 transitions, 1659 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-30 10:10:05,385 INFO L231 Difference]: Finished difference. Result has 95 places, 141 transitions, 1347 flow [2025-04-30 10:10:05,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1347, PETRI_PLACES=95, PETRI_TRANSITIONS=141} [2025-04-30 10:10:05,385 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2025-04-30 10:10:05,385 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 141 transitions, 1347 flow [2025-04-30 10:10:05,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:05,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:05,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:05,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:10:05,386 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:05,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2143882361, now seen corresponding path program 6 times [2025-04-30 10:10:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:05,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422771567] [2025-04-30 10:10:05,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:10:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:05,392 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:10:05,396 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:10:05,396 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:10:05,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:05,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422771567] [2025-04-30 10:10:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422771567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:05,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:10:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928196930] [2025-04-30 10:10:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:05,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:10:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:05,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:10:05,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:10:05,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:05,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 141 transitions, 1347 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:05,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:05,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:05,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:06,035 INFO L116 PetriNetUnfolderBase]: 866/1770 cut-off events. [2025-04-30 10:10:06,035 INFO L117 PetriNetUnfolderBase]: For 5728/5785 co-relation queries the response was YES. [2025-04-30 10:10:06,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 1770 events. 866/1770 cut-off events. For 5728/5785 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10229 event pairs, 197 based on Foata normal form. 59/1816 useless extension candidates. Maximal degree in co-relation 7966. Up to 1229 conditions per place. [2025-04-30 10:10:06,052 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 97 selfloop transitions, 73 changer transitions 0/179 dead transitions. [2025-04-30 10:10:06,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 179 transitions, 1917 flow [2025-04-30 10:10:06,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:10:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:10:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-04-30 10:10:06,053 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-04-30 10:10:06,053 INFO L175 Difference]: Start difference. First operand has 95 places, 141 transitions, 1347 flow. Second operand 9 states and 150 transitions. [2025-04-30 10:10:06,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 179 transitions, 1917 flow [2025-04-30 10:10:06,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 179 transitions, 1817 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-30 10:10:06,082 INFO L231 Difference]: Finished difference. Result has 99 places, 154 transitions, 1604 flow [2025-04-30 10:10:06,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=154} [2025-04-30 10:10:06,083 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2025-04-30 10:10:06,083 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 154 transitions, 1604 flow [2025-04-30 10:10:06,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:06,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:06,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:06,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:10:06,083 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:06,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash -776013327, now seen corresponding path program 7 times [2025-04-30 10:10:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:06,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074164769] [2025-04-30 10:10:06,084 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:10:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:10:06,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:10:06,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:06,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:06,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074164769] [2025-04-30 10:10:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074164769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:06,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:06,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:10:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289296250] [2025-04-30 10:10:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:06,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:10:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:06,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:10:06,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:10:06,310 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:06,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 154 transitions, 1604 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:06,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:06,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:06,654 INFO L116 PetriNetUnfolderBase]: 724/1495 cut-off events. [2025-04-30 10:10:06,655 INFO L117 PetriNetUnfolderBase]: For 4694/4750 co-relation queries the response was YES. [2025-04-30 10:10:06,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6687 conditions, 1495 events. 724/1495 cut-off events. For 4694/4750 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8593 event pairs, 178 based on Foata normal form. 63/1546 useless extension candidates. Maximal degree in co-relation 6656. Up to 1072 conditions per place. [2025-04-30 10:10:06,665 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 99 selfloop transitions, 47 changer transitions 0/155 dead transitions. [2025-04-30 10:10:06,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 155 transitions, 1628 flow [2025-04-30 10:10:06,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:10:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:10:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2025-04-30 10:10:06,666 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2025-04-30 10:10:06,666 INFO L175 Difference]: Start difference. First operand has 99 places, 154 transitions, 1604 flow. Second operand 10 states and 166 transitions. [2025-04-30 10:10:06,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 155 transitions, 1628 flow [2025-04-30 10:10:06,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 155 transitions, 1543 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-04-30 10:10:06,683 INFO L231 Difference]: Finished difference. Result has 99 places, 129 transitions, 1224 flow [2025-04-30 10:10:06,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1224, PETRI_PLACES=99, PETRI_TRANSITIONS=129} [2025-04-30 10:10:06,683 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2025-04-30 10:10:06,683 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 129 transitions, 1224 flow [2025-04-30 10:10:06,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2025-04-30 10:10:06,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:06,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:06,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:10:06,684 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:06,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1694631896, now seen corresponding path program 1 times [2025-04-30 10:10:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:06,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924035809] [2025-04-30 10:10:06,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:06,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:10:06,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:10:06,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:06,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:06,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924035809] [2025-04-30 10:10:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924035809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:10:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475219392] [2025-04-30 10:10:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:06,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:10:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:06,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:10:06,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:10:06,812 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-30 10:10:06,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 129 transitions, 1224 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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) [2025-04-30 10:10:06,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:06,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-30 10:10:06,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:07,179 INFO L116 PetriNetUnfolderBase]: 905/1931 cut-off events. [2025-04-30 10:10:07,179 INFO L117 PetriNetUnfolderBase]: For 6322/6342 co-relation queries the response was YES. [2025-04-30 10:10:07,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8434 conditions, 1931 events. 905/1931 cut-off events. For 6322/6342 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12363 event pairs, 205 based on Foata normal form. 24/1951 useless extension candidates. Maximal degree in co-relation 8407. Up to 1169 conditions per place. [2025-04-30 10:10:07,196 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 180 selfloop transitions, 36 changer transitions 0/232 dead transitions. [2025-04-30 10:10:07,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 232 transitions, 2332 flow [2025-04-30 10:10:07,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:10:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:10:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2025-04-30 10:10:07,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-04-30 10:10:07,198 INFO L175 Difference]: Start difference. First operand has 99 places, 129 transitions, 1224 flow. Second operand 9 states and 198 transitions. [2025-04-30 10:10:07,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 232 transitions, 2332 flow [2025-04-30 10:10:07,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 232 transitions, 2205 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-04-30 10:10:07,217 INFO L231 Difference]: Finished difference. Result has 102 places, 150 transitions, 1429 flow [2025-04-30 10:10:07,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1429, PETRI_PLACES=102, PETRI_TRANSITIONS=150} [2025-04-30 10:10:07,218 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2025-04-30 10:10:07,218 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 150 transitions, 1429 flow [2025-04-30 10:10:07,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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) [2025-04-30 10:10:07,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:07,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:07,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:10:07,219 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:07,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2023836240, now seen corresponding path program 1 times [2025-04-30 10:10:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:07,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766959530] [2025-04-30 10:10:07,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:10:07,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:10:07,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:07,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:07,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:07,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766959530] [2025-04-30 10:10:07,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766959530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:10:07,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738945458] [2025-04-30 10:10:07,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:07,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:10:07,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:10:07,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:10:07,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:10:07,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:10:07,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:10:07,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:07,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:07,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:10:07,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:10:07,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:10:07,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:10:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:07,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:10:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738945458] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:10:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:10:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-30 10:10:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599433375] [2025-04-30 10:10:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:07,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:10:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:07,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:10:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:10:07,731 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-30 10:10:07,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 150 transitions, 1429 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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) [2025-04-30 10:10:07,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:07,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-30 10:10:07,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:08,239 INFO L116 PetriNetUnfolderBase]: 1628/3451 cut-off events. [2025-04-30 10:10:08,239 INFO L117 PetriNetUnfolderBase]: For 14770/14802 co-relation queries the response was YES. [2025-04-30 10:10:08,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16113 conditions, 3451 events. 1628/3451 cut-off events. For 14770/14802 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 23007 event pairs, 410 based on Foata normal form. 26/3461 useless extension candidates. Maximal degree in co-relation 16082. Up to 1148 conditions per place. [2025-04-30 10:10:08,257 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 266 selfloop transitions, 58 changer transitions 0/340 dead transitions. [2025-04-30 10:10:08,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 340 transitions, 3518 flow [2025-04-30 10:10:08,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:10:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:10:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2025-04-30 10:10:08,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-04-30 10:10:08,259 INFO L175 Difference]: Start difference. First operand has 102 places, 150 transitions, 1429 flow. Second operand 7 states and 175 transitions. [2025-04-30 10:10:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 340 transitions, 3518 flow [2025-04-30 10:10:08,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 340 transitions, 3439 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-04-30 10:10:08,289 INFO L231 Difference]: Finished difference. Result has 111 places, 174 transitions, 1862 flow [2025-04-30 10:10:08,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1862, PETRI_PLACES=111, PETRI_TRANSITIONS=174} [2025-04-30 10:10:08,291 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 78 predicate places. [2025-04-30 10:10:08,291 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 174 transitions, 1862 flow [2025-04-30 10:10:08,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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) [2025-04-30 10:10:08,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:08,291 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:08,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:10:08,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:10:08,492 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:08,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1900189068, now seen corresponding path program 1 times [2025-04-30 10:10:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:08,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112009863] [2025-04-30 10:10:08,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:10:08,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:10:08,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:08,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:08,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112009863] [2025-04-30 10:10:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112009863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:10:08,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330708996] [2025-04-30 10:10:08,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:08,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:10:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:10:08,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:10:08,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:10:08,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:10:08,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:10:08,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:08,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:08,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:10:08,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:10:09,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-04-30 10:10:09,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:10:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:09,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:10:09,191 INFO L325 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-04-30 10:10:09,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2025-04-30 10:10:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:10:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330708996] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:10:09,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:10:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 8] total 21 [2025-04-30 10:10:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368342096] [2025-04-30 10:10:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:09,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:10:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:09,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:10:09,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:10:09,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-30 10:10:09,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 174 transitions, 1862 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2025-04-30 10:10:09,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:09,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-30 10:10:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:09,856 INFO L116 PetriNetUnfolderBase]: 2888/5708 cut-off events. [2025-04-30 10:10:09,856 INFO L117 PetriNetUnfolderBase]: For 30665/30667 co-relation queries the response was YES. [2025-04-30 10:10:09,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28534 conditions, 5708 events. 2888/5708 cut-off events. For 30665/30667 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 39180 event pairs, 221 based on Foata normal form. 52/5752 useless extension candidates. Maximal degree in co-relation 28497. Up to 2803 conditions per place. [2025-04-30 10:10:09,882 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 208 selfloop transitions, 144 changer transitions 0/358 dead transitions. [2025-04-30 10:10:09,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 358 transitions, 4265 flow [2025-04-30 10:10:09,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:10:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:10:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-04-30 10:10:09,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2025-04-30 10:10:09,883 INFO L175 Difference]: Start difference. First operand has 111 places, 174 transitions, 1862 flow. Second operand 8 states and 141 transitions. [2025-04-30 10:10:09,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 358 transitions, 4265 flow [2025-04-30 10:10:09,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 358 transitions, 4151 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-04-30 10:10:09,944 INFO L231 Difference]: Finished difference. Result has 123 places, 281 transitions, 3597 flow [2025-04-30 10:10:09,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3597, PETRI_PLACES=123, PETRI_TRANSITIONS=281} [2025-04-30 10:10:09,944 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 90 predicate places. [2025-04-30 10:10:09,944 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 281 transitions, 3597 flow [2025-04-30 10:10:09,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2025-04-30 10:10:09,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:09,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:09,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:10:10,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:10:10,149 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:10,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -210633436, now seen corresponding path program 2 times [2025-04-30 10:10:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:10,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287388114] [2025-04-30 10:10:10,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:10:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:10,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-30 10:10:10,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-04-30 10:10:10,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:10:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:10:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:10,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287388114] [2025-04-30 10:10:10,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287388114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:10,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:10,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:10:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399441516] [2025-04-30 10:10:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:10,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:10:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:10,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:10:10,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:10:10,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-30 10:10:10,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 281 transitions, 3597 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2025-04-30 10:10:10,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:10,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-30 10:10:10,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:11,053 INFO L116 PetriNetUnfolderBase]: 3238/6345 cut-off events. [2025-04-30 10:10:11,053 INFO L117 PetriNetUnfolderBase]: For 45026/45026 co-relation queries the response was YES. [2025-04-30 10:10:11,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36423 conditions, 6345 events. 3238/6345 cut-off events. For 45026/45026 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 44097 event pairs, 349 based on Foata normal form. 106/6448 useless extension candidates. Maximal degree in co-relation 36380. Up to 2600 conditions per place. [2025-04-30 10:10:11,098 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 234 selfloop transitions, 150 changer transitions 0/390 dead transitions. [2025-04-30 10:10:11,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 390 transitions, 5390 flow [2025-04-30 10:10:11,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:10:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:10:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2025-04-30 10:10:11,103 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4749034749034749 [2025-04-30 10:10:11,103 INFO L175 Difference]: Start difference. First operand has 123 places, 281 transitions, 3597 flow. Second operand 7 states and 123 transitions. [2025-04-30 10:10:11,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 390 transitions, 5390 flow [2025-04-30 10:10:11,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 390 transitions, 5326 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-30 10:10:11,233 INFO L231 Difference]: Finished difference. Result has 134 places, 310 transitions, 4493 flow [2025-04-30 10:10:11,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3541, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4493, PETRI_PLACES=134, PETRI_TRANSITIONS=310} [2025-04-30 10:10:11,234 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places. [2025-04-30 10:10:11,234 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 310 transitions, 4493 flow [2025-04-30 10:10:11,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2025-04-30 10:10:11,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:11,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:11,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:10:11,234 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:11,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 148876762, now seen corresponding path program 3 times [2025-04-30 10:10:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:11,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401766836] [2025-04-30 10:10:11,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:10:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:11,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:10:11,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:10:11,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:10:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:11,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:11,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401766836] [2025-04-30 10:10:11,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401766836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:11,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:11,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:10:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448161535] [2025-04-30 10:10:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:11,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:10:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:11,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:10:11,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:10:11,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:11,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 310 transitions, 4493 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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) [2025-04-30 10:10:11,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:11,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:11,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:13,455 INFO L116 PetriNetUnfolderBase]: 6499/12679 cut-off events. [2025-04-30 10:10:13,455 INFO L117 PetriNetUnfolderBase]: For 131409/131488 co-relation queries the response was YES. [2025-04-30 10:10:13,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82106 conditions, 12679 events. 6499/12679 cut-off events. For 131409/131488 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 92247 event pairs, 1071 based on Foata normal form. 121/12659 useless extension candidates. Maximal degree in co-relation 82058. Up to 5498 conditions per place. [2025-04-30 10:10:13,543 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 468 selfloop transitions, 368 changer transitions 0/848 dead transitions. [2025-04-30 10:10:13,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 848 transitions, 13285 flow [2025-04-30 10:10:13,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:10:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:10:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 300 transitions. [2025-04-30 10:10:13,545 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-04-30 10:10:13,545 INFO L175 Difference]: Start difference. First operand has 134 places, 310 transitions, 4493 flow. Second operand 15 states and 300 transitions. [2025-04-30 10:10:13,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 848 transitions, 13285 flow [2025-04-30 10:10:14,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 848 transitions, 13064 flow, removed 80 selfloop flow, removed 1 redundant places. [2025-04-30 10:10:14,023 INFO L231 Difference]: Finished difference. Result has 161 places, 646 transitions, 11341 flow [2025-04-30 10:10:14,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11341, PETRI_PLACES=161, PETRI_TRANSITIONS=646} [2025-04-30 10:10:14,024 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 128 predicate places. [2025-04-30 10:10:14,024 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 646 transitions, 11341 flow [2025-04-30 10:10:14,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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) [2025-04-30 10:10:14,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:14,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:14,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:10:14,024 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:14,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -970371978, now seen corresponding path program 4 times [2025-04-30 10:10:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:14,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355871763] [2025-04-30 10:10:14,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:10:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:14,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-30 10:10:14,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-04-30 10:10:14,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:10:14,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:14,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:14,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355871763] [2025-04-30 10:10:14,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355871763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:14,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:14,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:10:14,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408904675] [2025-04-30 10:10:14,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:14,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:10:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:14,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:10:14,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:10:14,221 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-30 10:10:14,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 646 transitions, 11341 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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) [2025-04-30 10:10:14,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:14,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-30 10:10:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:16,315 INFO L116 PetriNetUnfolderBase]: 5587/11550 cut-off events. [2025-04-30 10:10:16,315 INFO L117 PetriNetUnfolderBase]: For 171054/171246 co-relation queries the response was YES. [2025-04-30 10:10:16,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86036 conditions, 11550 events. 5587/11550 cut-off events. For 171054/171246 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 88386 event pairs, 457 based on Foata normal form. 309/11693 useless extension candidates. Maximal degree in co-relation 85974. Up to 4589 conditions per place. [2025-04-30 10:10:16,428 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 706 selfloop transitions, 290 changer transitions 0/1050 dead transitions. [2025-04-30 10:10:16,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1050 transitions, 21127 flow [2025-04-30 10:10:16,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:10:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:10:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-04-30 10:10:16,431 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5777027027027027 [2025-04-30 10:10:16,431 INFO L175 Difference]: Start difference. First operand has 161 places, 646 transitions, 11341 flow. Second operand 8 states and 171 transitions. [2025-04-30 10:10:16,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1050 transitions, 21127 flow [2025-04-30 10:10:17,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 1050 transitions, 20781 flow, removed 173 selfloop flow, removed 0 redundant places. [2025-04-30 10:10:17,357 INFO L231 Difference]: Finished difference. Result has 170 places, 692 transitions, 12471 flow [2025-04-30 10:10:17,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11079, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12471, PETRI_PLACES=170, PETRI_TRANSITIONS=692} [2025-04-30 10:10:17,358 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 137 predicate places. [2025-04-30 10:10:17,358 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 692 transitions, 12471 flow [2025-04-30 10:10:17,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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) [2025-04-30 10:10:17,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:17,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:17,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:10:17,359 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:17,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1756603744, now seen corresponding path program 5 times [2025-04-30 10:10:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:17,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341292768] [2025-04-30 10:10:17,359 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:10:17,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:17,366 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:10:17,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:10:17,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:10:17,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:17,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:17,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341292768] [2025-04-30 10:10:17,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341292768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:17,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:10:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931163140] [2025-04-30 10:10:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:17,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:10:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:17,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:10:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:10:17,646 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-30 10:10:17,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 692 transitions, 12471 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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) [2025-04-30 10:10:17,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:17,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-30 10:10:17,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:20,943 INFO L116 PetriNetUnfolderBase]: 7931/15748 cut-off events. [2025-04-30 10:10:20,943 INFO L117 PetriNetUnfolderBase]: For 250890/251002 co-relation queries the response was YES. [2025-04-30 10:10:21,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122660 conditions, 15748 events. 7931/15748 cut-off events. For 250890/251002 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 123077 event pairs, 1555 based on Foata normal form. 80/15649 useless extension candidates. Maximal degree in co-relation 122595. Up to 9870 conditions per place. [2025-04-30 10:10:21,092 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 796 selfloop transitions, 368 changer transitions 0/1176 dead transitions. [2025-04-30 10:10:21,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1176 transitions, 22282 flow [2025-04-30 10:10:21,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:10:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:10:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 283 transitions. [2025-04-30 10:10:21,093 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5463320463320464 [2025-04-30 10:10:21,093 INFO L175 Difference]: Start difference. First operand has 170 places, 692 transitions, 12471 flow. Second operand 14 states and 283 transitions. [2025-04-30 10:10:21,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1176 transitions, 22282 flow [2025-04-30 10:10:22,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1176 transitions, 22054 flow, removed 50 selfloop flow, removed 1 redundant places. [2025-04-30 10:10:22,581 INFO L231 Difference]: Finished difference. Result has 195 places, 951 transitions, 18829 flow [2025-04-30 10:10:22,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12321, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18829, PETRI_PLACES=195, PETRI_TRANSITIONS=951} [2025-04-30 10:10:22,582 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 162 predicate places. [2025-04-30 10:10:22,582 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 951 transitions, 18829 flow [2025-04-30 10:10:22,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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) [2025-04-30 10:10:22,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:22,582 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:22,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:10:22,582 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:22,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 804449312, now seen corresponding path program 1 times [2025-04-30 10:10:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:22,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078529619] [2025-04-30 10:10:22,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:10:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:22,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:10:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:10:22,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:22,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:22,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078529619] [2025-04-30 10:10:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078529619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:10:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299047747] [2025-04-30 10:10:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:22,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:10:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:22,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:10:22,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:10:22,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-30 10:10:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 951 transitions, 18829 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2025-04-30 10:10:22,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:22,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-30 10:10:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:26,491 INFO L116 PetriNetUnfolderBase]: 7303/14937 cut-off events. [2025-04-30 10:10:26,491 INFO L117 PetriNetUnfolderBase]: For 307200/307462 co-relation queries the response was YES. [2025-04-30 10:10:26,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126638 conditions, 14937 events. 7303/14937 cut-off events. For 307200/307462 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 118640 event pairs, 1730 based on Foata normal form. 23/14835 useless extension candidates. Maximal degree in co-relation 126560. Up to 13017 conditions per place. [2025-04-30 10:10:26,669 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 818 selfloop transitions, 8 changer transitions 24/915 dead transitions. [2025-04-30 10:10:26,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 915 transitions, 19559 flow [2025-04-30 10:10:26,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:10:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:10:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-04-30 10:10:26,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-04-30 10:10:26,670 INFO L175 Difference]: Start difference. First operand has 195 places, 951 transitions, 18829 flow. Second operand 5 states and 95 transitions. [2025-04-30 10:10:26,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 915 transitions, 19559 flow [2025-04-30 10:10:28,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 915 transitions, 18718 flow, removed 415 selfloop flow, removed 1 redundant places. [2025-04-30 10:10:28,855 INFO L231 Difference]: Finished difference. Result has 200 places, 890 transitions, 16629 flow [2025-04-30 10:10:28,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16993, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16629, PETRI_PLACES=200, PETRI_TRANSITIONS=890} [2025-04-30 10:10:28,856 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 167 predicate places. [2025-04-30 10:10:28,856 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 890 transitions, 16629 flow [2025-04-30 10:10:28,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2025-04-30 10:10:28,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:28,856 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:28,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:10:28,856 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:28,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 351235118, now seen corresponding path program 6 times [2025-04-30 10:10:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:28,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339344252] [2025-04-30 10:10:28,856 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:10:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:28,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:10:28,865 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:10:28,865 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:10:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:29,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339344252] [2025-04-30 10:10:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339344252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:10:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:10:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-30 10:10:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288996328] [2025-04-30 10:10:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:10:29,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:10:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:29,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:10:29,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:10:29,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-30 10:10:29,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 890 transitions, 16629 flow. Second operand has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 14 states have internal predecessors, (120), 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) [2025-04-30 10:10:29,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:29,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-30 10:10:29,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:10:36,439 INFO L116 PetriNetUnfolderBase]: 14144/28008 cut-off events. [2025-04-30 10:10:36,439 INFO L117 PetriNetUnfolderBase]: For 580207/580382 co-relation queries the response was YES. [2025-04-30 10:10:36,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237346 conditions, 28008 events. 14144/28008 cut-off events. For 580207/580382 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 236129 event pairs, 2377 based on Foata normal form. 200/28105 useless extension candidates. Maximal degree in co-relation 237266. Up to 13162 conditions per place. [2025-04-30 10:10:36,831 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 1089 selfloop transitions, 814 changer transitions 0/1909 dead transitions. [2025-04-30 10:10:36,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1909 transitions, 38498 flow [2025-04-30 10:10:36,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:10:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-30 10:10:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 409 transitions. [2025-04-30 10:10:36,832 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4806110458284371 [2025-04-30 10:10:36,832 INFO L175 Difference]: Start difference. First operand has 200 places, 890 transitions, 16629 flow. Second operand 23 states and 409 transitions. [2025-04-30 10:10:36,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1909 transitions, 38498 flow [2025-04-30 10:10:41,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1909 transitions, 37570 flow, removed 207 selfloop flow, removed 12 redundant places. [2025-04-30 10:10:41,080 INFO L231 Difference]: Finished difference. Result has 221 places, 1576 transitions, 33267 flow [2025-04-30 10:10:41,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16183, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=33267, PETRI_PLACES=221, PETRI_TRANSITIONS=1576} [2025-04-30 10:10:41,081 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 188 predicate places. [2025-04-30 10:10:41,081 INFO L485 AbstractCegarLoop]: Abstraction has has 221 places, 1576 transitions, 33267 flow [2025-04-30 10:10:41,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 14 states have internal predecessors, (120), 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) [2025-04-30 10:10:41,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:10:41,081 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:10:41,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:10:41,081 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-30 10:10:41,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:10:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash 73111662, now seen corresponding path program 7 times [2025-04-30 10:10:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:10:41,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376754274] [2025-04-30 10:10:41,082 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:10:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:10:41,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:10:41,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:10:41,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:41,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:10:41,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376754274] [2025-04-30 10:10:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376754274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:10:41,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446711772] [2025-04-30 10:10:41,475 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:10:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:10:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:10:41,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:10:41,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:10:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:10:41,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:10:41,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:10:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:10:41,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:10:41,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:10:41,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:10:41,646 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:10:41,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:10:41,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:10:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:41,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:10:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:10:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446711772] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:10:42,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:10:42,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2025-04-30 10:10:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574553735] [2025-04-30 10:10:42,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:10:42,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:10:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:10:42,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:10:42,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:10:42,134 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-30 10:10:42,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1576 transitions, 33267 flow. Second operand has 30 states, 30 states have (on average 9.133333333333333) internal successors, (274), 30 states have internal predecessors, (274), 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) [2025-04-30 10:10:42,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:10:42,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-30 10:10:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:11:04,151 INFO L116 PetriNetUnfolderBase]: 27892/55029 cut-off events. [2025-04-30 10:11:04,151 INFO L117 PetriNetUnfolderBase]: For 1484456/1484676 co-relation queries the response was YES. [2025-04-30 10:11:04,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512396 conditions, 55029 events. 27892/55029 cut-off events. For 1484456/1484676 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 505431 event pairs, 3913 based on Foata normal form. 588/55360 useless extension candidates. Maximal degree in co-relation 512305. Up to 16731 conditions per place. Killed by 15