./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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 ../sv-benchmarks/c/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-?-735b3cc-m [2025-03-14 00:56:52,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:56:52,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:56:52,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:56:52,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:56:52,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:56:52,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:56:52,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:56:52,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:56:52,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:56:52,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:56:52,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:56:52,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:56:52,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:56:52,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:56:52,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:56:52,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:56:52,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:56:52,351 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-03-14 00:56:52,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:56:52,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:56:52,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:56:52,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:56:52,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:56:52,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-14 00:56:53,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472859126/572f350771534b86af5483be725a69c0/FLAG9a8d7dfdf [2025-03-14 00:56:53,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:56:53,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-14 00:56:54,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472859126/572f350771534b86af5483be725a69c0/FLAG9a8d7dfdf [2025-03-14 00:56:54,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472859126/572f350771534b86af5483be725a69c0 [2025-03-14 00:56:54,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:56:54,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:56:54,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:56:54,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:56:54,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:56:54,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54, skipping insertion in model container [2025-03-14 00:56:54,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:56:54,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-14 00:56:54,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:56:54,619 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:56:54,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-14 00:56:54,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:56:54,682 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:56:54,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54 WrapperNode [2025-03-14 00:56:54,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:56:54,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:56:54,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:56:54,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:56:54,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,711 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-03-14 00:56:54,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:56:54,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:56:54,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:56:54,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:56:54,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,728 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-03-14 00:56:54,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:56:54,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:56:54,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:56:54,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:56:54,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (1/1) ... [2025-03-14 00:56:54,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:56:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:56:54,763 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-03-14 00:56:54,765 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-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-14 00:56:54,780 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:56:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:56:54,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:56:54,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:56:54,782 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:56:54,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:56:54,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:56:55,024 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:56:55,025 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:56:55,025 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:56:55,175 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:56:55,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:56:55 BoogieIcfgContainer [2025-03-14 00:56:55,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:56:55,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:56:55,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:56:55,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:56:55,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:56:54" (1/3) ... [2025-03-14 00:56:55,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cab2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:56:55, skipping insertion in model container [2025-03-14 00:56:55,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:54" (2/3) ... [2025-03-14 00:56:55,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cab2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:56:55, skipping insertion in model container [2025-03-14 00:56:55,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:56:55" (3/3) ... [2025-03-14 00:56:55,182 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-14 00:56:55,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:56:55,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-14 00:56:55,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:56:55,238 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:56:55,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-03-14 00:56:55,281 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-14 00:56:55,283 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:56:55,285 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 47 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-03-14 00:56:55,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-03-14 00:56:55,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-03-14 00:56:55,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:56:55,306 INFO L333 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;@64fb3e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:56:55,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:56:55,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:56:55,314 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-14 00:56:55,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:56:55,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:55,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:55,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:55,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1304646758, now seen corresponding path program 1 times [2025-03-14 00:56:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712452900] [2025-03-14 00:56:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:55,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-14 00:56:55,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-14 00:56:55,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:55,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:55,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712452900] [2025-03-14 00:56:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712452900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:55,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:55,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:56:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594283576] [2025-03-14 00:56:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:55,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:56:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:55,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:56:55,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:56:55,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-14 00:56:55,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 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-03-14 00:56:55,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:55,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-14 00:56:55,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:55,983 INFO L124 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-03-14 00:56:55,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:56:56,006 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 28. Compared 1930 event pairs, 20 based on Foata normal form. 37/407 useless extension candidates. Maximal degree in co-relation 851. Up to 241 conditions per place. [2025-03-14 00:56:56,009 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-03-14 00:56:56,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 265 flow [2025-03-14 00:56:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:56:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:56:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-14 00:56:56,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536036036036036 [2025-03-14 00:56:56,023 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 6 states and 119 transitions. [2025-03-14 00:56:56,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 265 flow [2025-03-14 00:56:56,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:56:56,030 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 168 flow [2025-03-14 00:56:56,032 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-14 00:56:56,035 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-14 00:56:56,035 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 168 flow [2025-03-14 00:56:56,035 INFO L472 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-03-14 00:56:56,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:56,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:56,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:56:56,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:56,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1789374339, now seen corresponding path program 1 times [2025-03-14 00:56:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:56,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457681826] [2025-03-14 00:56:56,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:56,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:56:56,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:56:56,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:56,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457681826] [2025-03-14 00:56:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457681826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:56:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247472673] [2025-03-14 00:56:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:56,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:56:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:56,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:56:56,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:56:56,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-14 00:56:56,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 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-03-14 00:56:56,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:56,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-14 00:56:56,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:56,340 INFO L124 PetriNetUnfolderBase]: 279/560 cut-off events. [2025-03-14 00:56:56,340 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-03-14 00:56:56,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 560 events. 279/560 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2496 event pairs, 55 based on Foata normal form. 20/539 useless extension candidates. Maximal degree in co-relation 1387. Up to 304 conditions per place. [2025-03-14 00:56:56,344 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-03-14 00:56:56,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 474 flow [2025-03-14 00:56:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:56:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:56:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-14 00:56:56,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-14 00:56:56,347 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-03-14 00:56:56,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 474 flow [2025-03-14 00:56:56,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:56:56,354 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 366 flow [2025-03-14 00:56:56,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=51, PETRI_TRANSITIONS=60} [2025-03-14 00:56:56,354 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2025-03-14 00:56:56,354 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 366 flow [2025-03-14 00:56:56,354 INFO L472 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-03-14 00:56:56,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:56,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:56,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:56:56,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:56,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -57772208, now seen corresponding path program 1 times [2025-03-14 00:56:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790719300] [2025-03-14 00:56:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:56:56,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:56:56,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:56,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790719300] [2025-03-14 00:56:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790719300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:56:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301317793] [2025-03-14 00:56:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:56:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:56,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:56:56,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:56:56,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-14 00:56:56,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 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-03-14 00:56:56,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:56,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-14 00:56:56,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:56,892 INFO L124 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-03-14 00:56:56,892 INFO L125 PetriNetUnfolderBase]: For 1252/1269 co-relation queries the response was YES. [2025-03-14 00:56:56,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 859 events. 399/859 cut-off events. For 1252/1269 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4770 event pairs, 87 based on Foata normal form. 16/820 useless extension candidates. Maximal degree in co-relation 2722. Up to 360 conditions per place. [2025-03-14 00:56:56,896 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-03-14 00:56:56,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 127 transitions, 942 flow [2025-03-14 00:56:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:56:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:56:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-03-14 00:56:56,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-03-14 00:56:56,898 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-03-14 00:56:56,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 127 transitions, 942 flow [2025-03-14 00:56:56,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:56:56,905 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 588 flow [2025-03-14 00:56:56,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=60, PETRI_TRANSITIONS=76} [2025-03-14 00:56:56,905 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-03-14 00:56:56,905 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 588 flow [2025-03-14 00:56:56,906 INFO L472 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-03-14 00:56:56,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:56,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:56,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:56:56,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:56,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash -295283684, now seen corresponding path program 2 times [2025-03-14 00:56:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-14 00:56:56,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:56:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:56,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:56:56,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:56:56,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:56:56,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-14 00:56:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312306588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:57,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:56:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862392976] [2025-03-14 00:56:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:56:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:56:57,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:56:57,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-14 00:56:57,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-03-14 00:56:57,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:57,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-14 00:56:57,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:57,554 INFO L124 PetriNetUnfolderBase]: 485/974 cut-off events. [2025-03-14 00:56:57,555 INFO L125 PetriNetUnfolderBase]: For 2055/2055 co-relation queries the response was YES. [2025-03-14 00:56:57,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 974 events. 485/974 cut-off events. For 2055/2055 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5068 event pairs, 125 based on Foata normal form. 1/975 useless extension candidates. Maximal degree in co-relation 3547. Up to 623 conditions per place. [2025-03-14 00:56:57,563 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 77 selfloop transitions, 67 changer transitions 0/150 dead transitions. [2025-03-14 00:56:57,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 150 transitions, 1398 flow [2025-03-14 00:56:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:56:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:56:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2025-03-14 00:56:57,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39293139293139295 [2025-03-14 00:56:57,565 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 588 flow. Second operand 13 states and 189 transitions. [2025-03-14 00:56:57,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 150 transitions, 1398 flow [2025-03-14 00:56:57,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:56:57,577 INFO L231 Difference]: Finished difference. Result has 76 places, 116 transitions, 1098 flow [2025-03-14 00:56:57,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1098, PETRI_PLACES=76, PETRI_TRANSITIONS=116} [2025-03-14 00:56:57,579 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2025-03-14 00:56:57,579 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 116 transitions, 1098 flow [2025-03-14 00:56:57,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-03-14 00:56:57,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:57,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:56:57,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash 222292550, now seen corresponding path program 3 times [2025-03-14 00:56:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481560194] [2025-03-14 00:56:57,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:56:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:57,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:56:57,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:56:57,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:56:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481560194] [2025-03-14 00:56:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481560194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:56:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449379927] [2025-03-14 00:56:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:57,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:56:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:57,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:56:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:56:57,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-14 00:56:57,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 116 transitions, 1098 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-03-14 00:56:57,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:57,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-14 00:56:57,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:58,229 INFO L124 PetriNetUnfolderBase]: 468/966 cut-off events. [2025-03-14 00:56:58,231 INFO L125 PetriNetUnfolderBase]: For 2649/2677 co-relation queries the response was YES. [2025-03-14 00:56:58,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 966 events. 468/966 cut-off events. For 2649/2677 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5146 event pairs, 103 based on Foata normal form. 38/1001 useless extension candidates. Maximal degree in co-relation 3887. Up to 574 conditions per place. [2025-03-14 00:56:58,238 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 73 selfloop transitions, 74 changer transitions 0/158 dead transitions. [2025-03-14 00:56:58,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 158 transitions, 1666 flow [2025-03-14 00:56:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:56:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:56:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-03-14 00:56:58,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-03-14 00:56:58,242 INFO L175 Difference]: Start difference. First operand has 76 places, 116 transitions, 1098 flow. Second operand 9 states and 150 transitions. [2025-03-14 00:56:58,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 158 transitions, 1666 flow [2025-03-14 00:56:58,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 158 transitions, 1638 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-03-14 00:56:58,254 INFO L231 Difference]: Finished difference. Result has 88 places, 133 transitions, 1479 flow [2025-03-14 00:56:58,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1479, PETRI_PLACES=88, PETRI_TRANSITIONS=133} [2025-03-14 00:56:58,257 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2025-03-14 00:56:58,258 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 133 transitions, 1479 flow [2025-03-14 00:56:58,258 INFO L472 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-03-14 00:56:58,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:58,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:58,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:56:58,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:58,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash -212223524, now seen corresponding path program 4 times [2025-03-14 00:56:58,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:58,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559948024] [2025-03-14 00:56:58,260 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:56:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:58,270 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-03-14 00:56:58,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-03-14 00:56:58,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 00:56:58,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559948024] [2025-03-14 00:56:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559948024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:58,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:58,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:56:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449806614] [2025-03-14 00:56:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:58,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:56:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:58,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:56:58,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:56:58,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-14 00:56:58,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 133 transitions, 1479 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-03-14 00:56:58,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:58,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-14 00:56:58,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:58,518 INFO L124 PetriNetUnfolderBase]: 397/888 cut-off events. [2025-03-14 00:56:58,519 INFO L125 PetriNetUnfolderBase]: For 3231/3250 co-relation queries the response was YES. [2025-03-14 00:56:58,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3888 conditions, 888 events. 397/888 cut-off events. For 3231/3250 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5005 event pairs, 5 based on Foata normal form. 42/928 useless extension candidates. Maximal degree in co-relation 3851. Up to 223 conditions per place. [2025-03-14 00:56:58,527 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 143 selfloop transitions, 47 changer transitions 0/214 dead transitions. [2025-03-14 00:56:58,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 214 transitions, 2351 flow [2025-03-14 00:56:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:56:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:56:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-03-14 00:56:58,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2025-03-14 00:56:58,529 INFO L175 Difference]: Start difference. First operand has 88 places, 133 transitions, 1479 flow. Second operand 6 states and 146 transitions. [2025-03-14 00:56:58,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 214 transitions, 2351 flow [2025-03-14 00:56:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 214 transitions, 2207 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-03-14 00:56:58,542 INFO L231 Difference]: Finished difference. Result has 92 places, 147 transitions, 1532 flow [2025-03-14 00:56:58,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1532, PETRI_PLACES=92, PETRI_TRANSITIONS=147} [2025-03-14 00:56:58,542 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2025-03-14 00:56:58,542 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 147 transitions, 1532 flow [2025-03-14 00:56:58,542 INFO L472 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-03-14 00:56:58,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:58,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:58,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:56:58,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:58,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 274067710, now seen corresponding path program 5 times [2025-03-14 00:56:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:58,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-14 00:56:58,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:56:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:58,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:56:58,555 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:56:58,556 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:56:58,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:58,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-14 00:56:58,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:58,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:58,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:56:58,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062331942] [2025-03-14 00:56:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:58,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:56:58,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:58,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:56:58,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:56:58,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-14 00:56:58,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 147 transitions, 1532 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-03-14 00:56:58,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:58,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-14 00:56:58,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:58,979 INFO L124 PetriNetUnfolderBase]: 629/1400 cut-off events. [2025-03-14 00:56:58,979 INFO L125 PetriNetUnfolderBase]: For 5859/5874 co-relation queries the response was YES. [2025-03-14 00:56:58,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1400 events. 629/1400 cut-off events. For 5859/5874 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8689 event pairs, 189 based on Foata normal form. 19/1411 useless extension candidates. Maximal degree in co-relation 6659. Up to 658 conditions per place. [2025-03-14 00:56:58,989 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 151 selfloop transitions, 52 changer transitions 0/222 dead transitions. [2025-03-14 00:56:58,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 222 transitions, 2536 flow [2025-03-14 00:56:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:56:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:56:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-03-14 00:56:58,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-03-14 00:56:58,990 INFO L175 Difference]: Start difference. First operand has 92 places, 147 transitions, 1532 flow. Second operand 7 states and 166 transitions. [2025-03-14 00:56:58,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 222 transitions, 2536 flow [2025-03-14 00:56:59,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 222 transitions, 2463 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-14 00:56:59,010 INFO L231 Difference]: Finished difference. Result has 98 places, 159 transitions, 1791 flow [2025-03-14 00:56:59,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1791, PETRI_PLACES=98, PETRI_TRANSITIONS=159} [2025-03-14 00:56:59,011 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 65 predicate places. [2025-03-14 00:56:59,011 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 159 transitions, 1791 flow [2025-03-14 00:56:59,011 INFO L472 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-03-14 00:56:59,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:59,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:59,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:56:59,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1762842032, now seen corresponding path program 6 times [2025-03-14 00:56:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389548936] [2025-03-14 00:56:59,012 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:56:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:59,020 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:56:59,023 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:56:59,023 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 00:56:59,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:59,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389548936] [2025-03-14 00:56:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389548936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:59,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:56:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971677844] [2025-03-14 00:56:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:59,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:56:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:59,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:56:59,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:56:59,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-14 00:56:59,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 159 transitions, 1791 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-03-14 00:56:59,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:59,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-14 00:56:59,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:59,472 INFO L124 PetriNetUnfolderBase]: 833/1844 cut-off events. [2025-03-14 00:56:59,472 INFO L125 PetriNetUnfolderBase]: For 9392/9411 co-relation queries the response was YES. [2025-03-14 00:56:59,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9102 conditions, 1844 events. 833/1844 cut-off events. For 9392/9411 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11107 event pairs, 231 based on Foata normal form. 23/1860 useless extension candidates. Maximal degree in co-relation 9060. Up to 568 conditions per place. [2025-03-14 00:56:59,485 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 186 selfloop transitions, 53 changer transitions 0/258 dead transitions. [2025-03-14 00:56:59,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 258 transitions, 3037 flow [2025-03-14 00:56:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:56:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:56:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-03-14 00:56:59,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-14 00:56:59,486 INFO L175 Difference]: Start difference. First operand has 98 places, 159 transitions, 1791 flow. Second operand 7 states and 168 transitions. [2025-03-14 00:56:59,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 258 transitions, 3037 flow [2025-03-14 00:56:59,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 258 transitions, 2984 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-14 00:56:59,509 INFO L231 Difference]: Finished difference. Result has 105 places, 171 transitions, 2064 flow [2025-03-14 00:56:59,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2064, PETRI_PLACES=105, PETRI_TRANSITIONS=171} [2025-03-14 00:56:59,510 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 72 predicate places. [2025-03-14 00:56:59,510 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 171 transitions, 2064 flow [2025-03-14 00:56:59,510 INFO L472 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-03-14 00:56:59,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:59,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:56:59,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:56:59,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1657041066, now seen corresponding path program 7 times [2025-03-14 00:56:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028621125] [2025-03-14 00:56:59,511 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:56:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:56:59,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:56:59,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:59,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028621125] [2025-03-14 00:56:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028621125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:56:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936060553] [2025-03-14 00:56:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:59,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:56:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:56:59,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:56:59,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-14 00:56:59,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 171 transitions, 2064 flow. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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-03-14 00:56:59,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:59,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-14 00:56:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:00,115 INFO L124 PetriNetUnfolderBase]: 830/1741 cut-off events. [2025-03-14 00:57:00,116 INFO L125 PetriNetUnfolderBase]: For 9141/9151 co-relation queries the response was YES. [2025-03-14 00:57:00,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 1741 events. 830/1741 cut-off events. For 9141/9151 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9714 event pairs, 298 based on Foata normal form. 7/1747 useless extension candidates. Maximal degree in co-relation 8647. Up to 1312 conditions per place. [2025-03-14 00:57:00,128 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 119 selfloop transitions, 39 changer transitions 6/170 dead transitions. [2025-03-14 00:57:00,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 2057 flow [2025-03-14 00:57:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:57:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:57:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2025-03-14 00:57:00,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37422037422037424 [2025-03-14 00:57:00,130 INFO L175 Difference]: Start difference. First operand has 105 places, 171 transitions, 2064 flow. Second operand 13 states and 180 transitions. [2025-03-14 00:57:00,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 2057 flow [2025-03-14 00:57:00,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 170 transitions, 1898 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-03-14 00:57:00,151 INFO L231 Difference]: Finished difference. Result has 113 places, 140 transitions, 1460 flow [2025-03-14 00:57:00,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1460, PETRI_PLACES=113, PETRI_TRANSITIONS=140} [2025-03-14 00:57:00,151 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places. [2025-03-14 00:57:00,152 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1460 flow [2025-03-14 00:57:00,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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-03-14 00:57:00,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:00,152 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:00,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:57:00,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:00,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1321450124, now seen corresponding path program 1 times [2025-03-14 00:57:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680228353] [2025-03-14 00:57:00,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:57:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:00,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:57:00,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:57:00,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:57:00,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:00,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680228353] [2025-03-14 00:57:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680228353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:57:00,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:57:00,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 00:57:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324767857] [2025-03-14 00:57:00,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:57:00,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 00:57:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:00,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 00:57:00,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-14 00:57:00,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-14 00:57:00,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 140 transitions, 1460 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-03-14 00:57:00,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:00,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-14 00:57:00,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:01,138 INFO L124 PetriNetUnfolderBase]: 1615/3333 cut-off events. [2025-03-14 00:57:01,139 INFO L125 PetriNetUnfolderBase]: For 17071/17216 co-relation queries the response was YES. [2025-03-14 00:57:01,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16431 conditions, 3333 events. 1615/3333 cut-off events. For 17071/17216 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20716 event pairs, 357 based on Foata normal form. 196/3501 useless extension candidates. Maximal degree in co-relation 16386. Up to 1351 conditions per place. [2025-03-14 00:57:01,166 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 242 selfloop transitions, 156 changer transitions 0/410 dead transitions. [2025-03-14 00:57:01,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 410 transitions, 4685 flow [2025-03-14 00:57:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:57:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:57:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 302 transitions. [2025-03-14 00:57:01,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5441441441441441 [2025-03-14 00:57:01,168 INFO L175 Difference]: Start difference. First operand has 113 places, 140 transitions, 1460 flow. Second operand 15 states and 302 transitions. [2025-03-14 00:57:01,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 410 transitions, 4685 flow [2025-03-14 00:57:01,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 410 transitions, 4482 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-03-14 00:57:01,214 INFO L231 Difference]: Finished difference. Result has 127 places, 275 transitions, 3462 flow [2025-03-14 00:57:01,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3462, PETRI_PLACES=127, PETRI_TRANSITIONS=275} [2025-03-14 00:57:01,214 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 94 predicate places. [2025-03-14 00:57:01,215 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 275 transitions, 3462 flow [2025-03-14 00:57:01,215 INFO L472 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-03-14 00:57:01,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:01,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:01,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:57:01,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:01,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash -890936668, now seen corresponding path program 2 times [2025-03-14 00:57:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:01,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650805904] [2025-03-14 00:57:01,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:57:01,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:01,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-14 00:57:01,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-03-14 00:57:01,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:57:01,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 00:57:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:01,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650805904] [2025-03-14 00:57:01,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650805904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:57:01,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:57:01,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:57:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713111264] [2025-03-14 00:57:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:57:01,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:57:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:01,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:57:01,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:57:01,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-14 00:57:01,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 275 transitions, 3462 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-03-14 00:57:01,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:01,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-14 00:57:01,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:02,200 INFO L124 PetriNetUnfolderBase]: 2080/4229 cut-off events. [2025-03-14 00:57:02,200 INFO L125 PetriNetUnfolderBase]: For 35910/35942 co-relation queries the response was YES. [2025-03-14 00:57:02,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24709 conditions, 4229 events. 2080/4229 cut-off events. For 35910/35942 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 27185 event pairs, 274 based on Foata normal form. 46/4269 useless extension candidates. Maximal degree in co-relation 24653. Up to 1427 conditions per place. [2025-03-14 00:57:02,228 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 300 selfloop transitions, 253 changer transitions 0/559 dead transitions. [2025-03-14 00:57:02,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 559 transitions, 7892 flow [2025-03-14 00:57:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:57:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:57:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 222 transitions. [2025-03-14 00:57:02,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-14 00:57:02,230 INFO L175 Difference]: Start difference. First operand has 127 places, 275 transitions, 3462 flow. Second operand 14 states and 222 transitions. [2025-03-14 00:57:02,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 559 transitions, 7892 flow [2025-03-14 00:57:02,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 559 transitions, 7776 flow, removed 58 selfloop flow, removed 1 redundant places. [2025-03-14 00:57:02,340 INFO L231 Difference]: Finished difference. Result has 151 places, 453 transitions, 6893 flow [2025-03-14 00:57:02,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3410, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6893, PETRI_PLACES=151, PETRI_TRANSITIONS=453} [2025-03-14 00:57:02,341 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 118 predicate places. [2025-03-14 00:57:02,341 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 453 transitions, 6893 flow [2025-03-14 00:57:02,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-03-14 00:57:02,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:02,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:02,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:57:02,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:02,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1681171624, now seen corresponding path program 3 times [2025-03-14 00:57:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:02,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322838238] [2025-03-14 00:57:02,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:57:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:02,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-14 00:57:02,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-03-14 00:57:02,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:57:02,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 00:57:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322838238] [2025-03-14 00:57:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322838238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:57:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:57:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:57:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145620611] [2025-03-14 00:57:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:57:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:57:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:57:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:57:02,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-14 00:57:02,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 453 transitions, 6893 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-03-14 00:57:02,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:02,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-14 00:57:02,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:03,446 INFO L124 PetriNetUnfolderBase]: 2180/4441 cut-off events. [2025-03-14 00:57:03,446 INFO L125 PetriNetUnfolderBase]: For 54716/54720 co-relation queries the response was YES. [2025-03-14 00:57:03,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29847 conditions, 4441 events. 2180/4441 cut-off events. For 54716/54720 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 28623 event pairs, 121 based on Foata normal form. 24/4465 useless extension candidates. Maximal degree in co-relation 29780. Up to 1021 conditions per place. [2025-03-14 00:57:03,483 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 242 selfloop transitions, 417 changer transitions 0/665 dead transitions. [2025-03-14 00:57:03,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 665 transitions, 10857 flow [2025-03-14 00:57:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 00:57:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 00:57:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 262 transitions. [2025-03-14 00:57:03,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4165341812400636 [2025-03-14 00:57:03,485 INFO L175 Difference]: Start difference. First operand has 151 places, 453 transitions, 6893 flow. Second operand 17 states and 262 transitions. [2025-03-14 00:57:03,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 665 transitions, 10857 flow [2025-03-14 00:57:03,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 665 transitions, 10561 flow, removed 148 selfloop flow, removed 0 redundant places. [2025-03-14 00:57:03,725 INFO L231 Difference]: Finished difference. Result has 177 places, 585 transitions, 10103 flow [2025-03-14 00:57:03,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6649, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10103, PETRI_PLACES=177, PETRI_TRANSITIONS=585} [2025-03-14 00:57:03,726 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 144 predicate places. [2025-03-14 00:57:03,726 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 585 transitions, 10103 flow [2025-03-14 00:57:03,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-03-14 00:57:03,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:03,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:03,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 00:57:03,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:03,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1082596876, now seen corresponding path program 4 times [2025-03-14 00:57:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-03-14 00:57:03,727 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:57:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:03,734 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-14 00:57:03,740 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-03-14 00:57:03,740 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 00:57:03,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:03,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-03-14 00:57:03,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121043263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:57:03,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:57:03,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:57:03,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081161708] [2025-03-14 00:57:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:57:03,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:57:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:03,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:57:03,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:57:03,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-14 00:57:03,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 585 transitions, 10103 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-03-14 00:57:03,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:03,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-14 00:57:03,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:04,714 INFO L124 PetriNetUnfolderBase]: 2047/4353 cut-off events. [2025-03-14 00:57:04,714 INFO L125 PetriNetUnfolderBase]: For 64379/64517 co-relation queries the response was YES. [2025-03-14 00:57:04,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31727 conditions, 4353 events. 2047/4353 cut-off events. For 64379/64517 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29738 event pairs, 206 based on Foata normal form. 94/4406 useless extension candidates. Maximal degree in co-relation 31650. Up to 1522 conditions per place. [2025-03-14 00:57:04,752 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 519 selfloop transitions, 148 changer transitions 0/743 dead transitions. [2025-03-14 00:57:04,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 743 transitions, 13926 flow [2025-03-14 00:57:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:57:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:57:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-14 00:57:04,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-14 00:57:04,753 INFO L175 Difference]: Start difference. First operand has 177 places, 585 transitions, 10103 flow. Second operand 5 states and 110 transitions. [2025-03-14 00:57:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 743 transitions, 13926 flow [2025-03-14 00:57:05,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 743 transitions, 13590 flow, removed 148 selfloop flow, removed 2 redundant places. [2025-03-14 00:57:05,092 INFO L231 Difference]: Finished difference. Result has 181 places, 595 transitions, 10301 flow [2025-03-14 00:57:05,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9869, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10301, PETRI_PLACES=181, PETRI_TRANSITIONS=595} [2025-03-14 00:57:05,093 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 148 predicate places. [2025-03-14 00:57:05,093 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 595 transitions, 10301 flow [2025-03-14 00:57:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-03-14 00:57:05,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:05,093 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 00:57:05,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1947080749, now seen corresponding path program 1 times [2025-03-14 00:57:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-03-14 00:57:05,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:57:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:05,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 00:57:05,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 00:57:05,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:57:05,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-03-14 00:57:05,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459685826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:57:05,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:57:05,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:57:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888151088] [2025-03-14 00:57:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:57:05,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:57:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:05,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:57:05,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:57:05,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-14 00:57:05,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 595 transitions, 10301 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-03-14 00:57:05,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:05,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-14 00:57:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:06,049 INFO L124 PetriNetUnfolderBase]: 2062/4330 cut-off events. [2025-03-14 00:57:06,050 INFO L125 PetriNetUnfolderBase]: For 63161/63252 co-relation queries the response was YES. [2025-03-14 00:57:06,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32728 conditions, 4330 events. 2062/4330 cut-off events. For 63161/63252 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29084 event pairs, 428 based on Foata normal form. 13/4310 useless extension candidates. Maximal degree in co-relation 32649. Up to 3697 conditions per place. [2025-03-14 00:57:06,083 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 492 selfloop transitions, 8 changer transitions 23/581 dead transitions. [2025-03-14 00:57:06,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 581 transitions, 10973 flow [2025-03-14 00:57:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:57:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:57:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-14 00:57:06,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-03-14 00:57:06,084 INFO L175 Difference]: Start difference. First operand has 181 places, 595 transitions, 10301 flow. Second operand 5 states and 95 transitions. [2025-03-14 00:57:06,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 581 transitions, 10973 flow [2025-03-14 00:57:06,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 581 transitions, 10688 flow, removed 77 selfloop flow, removed 2 redundant places. [2025-03-14 00:57:06,397 INFO L231 Difference]: Finished difference. Result has 185 places, 557 transitions, 9296 flow [2025-03-14 00:57:06,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9599, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9296, PETRI_PLACES=185, PETRI_TRANSITIONS=557} [2025-03-14 00:57:06,397 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 152 predicate places. [2025-03-14 00:57:06,398 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 557 transitions, 9296 flow [2025-03-14 00:57:06,398 INFO L472 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-03-14 00:57:06,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:06,398 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:06,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 00:57:06,398 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash -924902277, now seen corresponding path program 5 times [2025-03-14 00:57:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:06,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-03-14 00:57:06,399 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:57:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:06,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-14 00:57:06,413 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:57:06,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:57:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:06,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-03-14 00:57:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453445260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:57:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063487250] [2025-03-14 00:57:06,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:57:06,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:57:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:57:06,927 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-03-14 00:57:06,929 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-03-14 00:57:06,982 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-14 00:57:07,003 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:57:07,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:57:07,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:07,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 00:57:07,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:57:07,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-14 00:57:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 00:57:07,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 00:57:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063487250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:57:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 00:57:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-03-14 00:57:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200755031] [2025-03-14 00:57:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:57:07,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:57:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:07,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:57:07,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-14 00:57:07,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-14 00:57:07,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 557 transitions, 9296 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-03-14 00:57:07,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:07,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-14 00:57:07,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:07,644 INFO L124 PetriNetUnfolderBase]: 668/1613 cut-off events. [2025-03-14 00:57:07,645 INFO L125 PetriNetUnfolderBase]: For 25016/25067 co-relation queries the response was YES. [2025-03-14 00:57:07,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12302 conditions, 1613 events. 668/1613 cut-off events. For 25016/25067 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9341 event pairs, 90 based on Foata normal form. 38/1628 useless extension candidates. Maximal degree in co-relation 12220. Up to 461 conditions per place. [2025-03-14 00:57:07,661 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 245 selfloop transitions, 136 changer transitions 0/425 dead transitions. [2025-03-14 00:57:07,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 425 transitions, 8158 flow [2025-03-14 00:57:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:57:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:57:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2025-03-14 00:57:07,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-03-14 00:57:07,662 INFO L175 Difference]: Start difference. First operand has 185 places, 557 transitions, 9296 flow. Second operand 8 states and 170 transitions. [2025-03-14 00:57:07,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 425 transitions, 8158 flow [2025-03-14 00:57:07,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 425 transitions, 6359 flow, removed 111 selfloop flow, removed 48 redundant places. [2025-03-14 00:57:07,766 INFO L231 Difference]: Finished difference. Result has 137 places, 381 transitions, 5484 flow [2025-03-14 00:57:07,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4527, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5484, PETRI_PLACES=137, PETRI_TRANSITIONS=381} [2025-03-14 00:57:07,766 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2025-03-14 00:57:07,767 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 381 transitions, 5484 flow [2025-03-14 00:57:07,767 INFO L472 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-03-14 00:57:07,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:57:07,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:57:07,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:57:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 00:57:07,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:57:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:57:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -935373530, now seen corresponding path program 1 times [2025-03-14 00:57:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:57:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255792636] [2025-03-14 00:57:07,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:57:07,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:57:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:57:07,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:57:07,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:57:07,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:57:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255792636] [2025-03-14 00:57:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255792636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:57:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945868151] [2025-03-14 00:57:08,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:57:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:57:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:57:08,167 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-03-14 00:57:08,169 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-03-14 00:57:08,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:57:08,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:57:08,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:57:08,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:57:08,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-14 00:57:08,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:57:08,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 00:57:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-14 00:57:08,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-14 00:57:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:08,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:57:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:57:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945868151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:57:08,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:57:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2025-03-14 00:57:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677331951] [2025-03-14 00:57:08,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:57:08,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 00:57:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:57:08,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 00:57:08,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-14 00:57:08,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-14 00:57:08,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 381 transitions, 5484 flow. Second operand has 26 states, 26 states have (on average 9.307692307692308) internal successors, (242), 26 states have internal predecessors, (242), 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-03-14 00:57:08,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:57:08,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-14 00:57:08,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:57:09,736 INFO L124 PetriNetUnfolderBase]: 867/2014 cut-off events. [2025-03-14 00:57:09,736 INFO L125 PetriNetUnfolderBase]: For 19076/19115 co-relation queries the response was YES. [2025-03-14 00:57:09,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13059 conditions, 2014 events. 867/2014 cut-off events. For 19076/19115 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11945 event pairs, 54 based on Foata normal form. 50/2064 useless extension candidates. Maximal degree in co-relation 13004. Up to 584 conditions per place. [2025-03-14 00:57:09,749 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 0 selfloop transitions, 0 changer transitions 560/560 dead transitions. [2025-03-14 00:57:09,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 560 transitions, 9007 flow [2025-03-14 00:57:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 00:57:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 00:57:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 273 transitions. [2025-03-14 00:57:09,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-03-14 00:57:09,751 INFO L175 Difference]: Start difference. First operand has 137 places, 381 transitions, 5484 flow. Second operand 21 states and 273 transitions. [2025-03-14 00:57:09,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 560 transitions, 9007 flow [2025-03-14 00:57:09,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 560 transitions, 8732 flow, removed 77 selfloop flow, removed 4 redundant places. [2025-03-14 00:57:09,810 INFO L231 Difference]: Finished difference. Result has 151 places, 0 transitions, 0 flow [2025-03-14 00:57:09,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5314, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=0, PETRI_PLACES=151, PETRI_TRANSITIONS=0} [2025-03-14 00:57:09,811 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 118 predicate places. [2025-03-14 00:57:09,811 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 0 transitions, 0 flow [2025-03-14 00:57:09,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.307692307692308) internal successors, (242), 26 states have internal predecessors, (242), 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-03-14 00:57:09,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:57:09,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:57:09,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 00:57:09,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:57:09,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:57:09,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:57:10,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 00:57:10,014 INFO L422 BasicCegarLoop]: Path program histogram: [7, 5, 1, 1, 1, 1] [2025-03-14 00:57:10,018 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:57:10,018 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:57:10,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:57:10 BasicIcfg [2025-03-14 00:57:10,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:57:10,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:57:10,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:57:10,022 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:57:10,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:56:55" (3/4) ... [2025-03-14 00:57:10,023 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:57:10,025 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-03-14 00:57:10,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-03-14 00:57:10,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-14 00:57:10,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-14 00:57:10,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:57:10,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:57:10,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:57:10,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:57:10,087 INFO L158 Benchmark]: Toolchain (without parser) took 15774.67ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 103.6MB in the beginning and 311.7MB in the end (delta: -208.0MB). Peak memory consumption was 922.1MB. Max. memory is 16.1GB. [2025-03-14 00:57:10,087 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:57:10,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.14ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.5MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:57:10,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.00ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:57:10,088 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:57:10,088 INFO L158 Benchmark]: IcfgBuilder took 439.28ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 36.2MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-14 00:57:10,088 INFO L158 Benchmark]: TraceAbstraction took 14843.98ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 36.2MB in the beginning and 315.9MB in the end (delta: -279.7MB). Peak memory consumption was 855.0MB. Max. memory is 16.1GB. [2025-03-14 00:57:10,088 INFO L158 Benchmark]: Witness Printer took 64.86ms. Allocated memory is still 1.3GB. Free memory was 315.9MB in the beginning and 311.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:57:10,089 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.14ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.5MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.00ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 439.28ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 36.2MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14843.98ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 36.2MB in the beginning and 315.9MB in the end (delta: -279.7MB). Peak memory consumption was 855.0MB. Max. memory is 16.1GB. * Witness Printer took 64.86ms. Allocated memory is still 1.3GB. Free memory was 315.9MB in the beginning and 311.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4408 IncrementalHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 53 mSDtfsCounter, 4408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10301occurred in iteration=13, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 325 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 3141 SizeOfPredicates, 32 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 15/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:57:10,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE