./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:11:37,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:11:37,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:11:37,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:11:37,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:11:37,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:11:37,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:11:37,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:11:37,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:11:37,992 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:11:37,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:11:37,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:11:37,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:11:37,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:11:37,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:11:37,994 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:11:37,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:37,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:11:37,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:11:37,995 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2025-03-04 02:11:38,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:11:38,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:11:38,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:11:38,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:11:38,223 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:11:38,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 02:11:39,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd39e05b/2f0fd50f9b1c41128482f33dc881ef91/FLAGba41b9780 [2025-03-04 02:11:39,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:11:39,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 02:11:39,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd39e05b/2f0fd50f9b1c41128482f33dc881ef91/FLAGba41b9780 [2025-03-04 02:11:39,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd39e05b/2f0fd50f9b1c41128482f33dc881ef91 [2025-03-04 02:11:39,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:11:39,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:11:39,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:39,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:11:39,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:11:39,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:39" (1/1) ... [2025-03-04 02:11:39,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd4485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:39, skipping insertion in model container [2025-03-04 02:11:39,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:39" (1/1) ... [2025-03-04 02:11:39,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:11:40,119 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/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-03-04 02:11:40,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:40,342 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:11:40,350 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/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-03-04 02:11:40,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:40,433 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:11:40,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40 WrapperNode [2025-03-04 02:11:40,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:40,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:40,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:11:40,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:11:40,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,465 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2025-03-04 02:11:40,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:40,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:11:40,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:11:40,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:11:40,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,486 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:11:40,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:11:40,505 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:11:40,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:11:40,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:11:40,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (1/1) ... [2025-03-04 02:11:40,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:40,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:11:40,535 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-04 02:11:40,541 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-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:11:40,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:11:40,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:11:40,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:11:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:11:40,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:11:40,557 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:11:40,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:11:40,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:11:40,983 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:11:40,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:11:41,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:11:41,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:11:41,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:41 BoogieIcfgContainer [2025-03-04 02:11:41,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:11:41,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:11:41,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:11:41,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:11:41,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:11:39" (1/3) ... [2025-03-04 02:11:41,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4553b38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:41, skipping insertion in model container [2025-03-04 02:11:41,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:40" (2/3) ... [2025-03-04 02:11:41,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4553b38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:41, skipping insertion in model container [2025-03-04 02:11:41,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:41" (3/3) ... [2025-03-04 02:11:41,214 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 02:11:41,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:11:41,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:11:41,226 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:11:41,278 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:11:41,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2025-03-04 02:11:41,328 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-03-04 02:11:41,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:41,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-03-04 02:11:41,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2025-03-04 02:11:41,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2025-03-04 02:11:41,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:11:41,353 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;@270bc503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:11:41,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:11:41,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:11:41,360 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-04 02:11:41,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:41,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:41,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:41,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash -661278564, now seen corresponding path program 1 times [2025-03-04 02:11:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:41,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579573894] [2025-03-04 02:11:41,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:41,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:11:41,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:11:41,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:41,778 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-04 02:11:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579573894] [2025-03-04 02:11:41,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579573894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:41,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:41,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:11:41,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262972707] [2025-03-04 02:11:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:41,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:11:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:41,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:11:41,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:11:41,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:11:41,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04 02:11:41,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:41,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:11:41,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:43,008 INFO L124 PetriNetUnfolderBase]: 5879/8502 cut-off events. [2025-03-04 02:11:43,009 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 02:11:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16965 conditions, 8502 events. 5879/8502 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 45890 event pairs, 804 based on Foata normal form. 294/8740 useless extension candidates. Maximal degree in co-relation 16954. Up to 7036 conditions per place. [2025-03-04 02:11:43,062 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 45 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-03-04 02:11:43,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 217 flow [2025-03-04 02:11:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:11:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:11:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-04 02:11:43,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2025-03-04 02:11:43,077 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 79 transitions. [2025-03-04 02:11:43,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 217 flow [2025-03-04 02:11:43,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:11:43,086 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2025-03-04 02:11:43,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-04 02:11:43,093 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-04 02:11:43,094 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2025-03-04 02:11:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04 02:11:43,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:43,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:43,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:11:43,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:43,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1568166077, now seen corresponding path program 1 times [2025-03-04 02:11:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85243618] [2025-03-04 02:11:43,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:43,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:11:43,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:11:43,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:43,687 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-04 02:11:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85243618] [2025-03-04 02:11:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85243618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:43,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:43,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:11:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722160521] [2025-03-04 02:11:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:11:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:43,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:11:43,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:11:43,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:43,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04 02:11:43,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:43,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:43,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:45,241 INFO L124 PetriNetUnfolderBase]: 8171/11823 cut-off events. [2025-03-04 02:11:45,242 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2025-03-04 02:11:45,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24089 conditions, 11823 events. 8171/11823 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 66872 event pairs, 1814 based on Foata normal form. 0/11620 useless extension candidates. Maximal degree in co-relation 24079. Up to 4975 conditions per place. [2025-03-04 02:11:45,352 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 55 selfloop transitions, 8 changer transitions 110/177 dead transitions. [2025-03-04 02:11:45,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 177 transitions, 724 flow [2025-03-04 02:11:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:11:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:11:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2025-03-04 02:11:45,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2025-03-04 02:11:45,356 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 260 transitions. [2025-03-04 02:11:45,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 177 transitions, 724 flow [2025-03-04 02:11:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 177 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:11:45,365 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 176 flow [2025-03-04 02:11:45,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-03-04 02:11:45,366 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-03-04 02:11:45,366 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 176 flow [2025-03-04 02:11:45,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04 02:11:45,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:45,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:11:45,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:45,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 639587185, now seen corresponding path program 1 times [2025-03-04 02:11:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869251195] [2025-03-04 02:11:45,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:45,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:11:45,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:11:45,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:45,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:45,657 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-04 02:11:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869251195] [2025-03-04 02:11:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869251195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:11:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96852684] [2025-03-04 02:11:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:45,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:11:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:11:45,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:11:45,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:45,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-04 02:11:45,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:46,486 INFO L124 PetriNetUnfolderBase]: 6068/8921 cut-off events. [2025-03-04 02:11:46,487 INFO L125 PetriNetUnfolderBase]: For 16641/16641 co-relation queries the response was YES. [2025-03-04 02:11:46,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28268 conditions, 8921 events. 6068/8921 cut-off events. For 16641/16641 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 48901 event pairs, 1658 based on Foata normal form. 195/9115 useless extension candidates. Maximal degree in co-relation 28247. Up to 7390 conditions per place. [2025-03-04 02:11:46,532 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 50 selfloop transitions, 4 changer transitions 51/109 dead transitions. [2025-03-04 02:11:46,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 722 flow [2025-03-04 02:11:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:11:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:11:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-03-04 02:11:46,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4912891986062718 [2025-03-04 02:11:46,536 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 176 flow. Second operand 7 states and 141 transitions. [2025-03-04 02:11:46,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 722 flow [2025-03-04 02:11:46,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 663 flow, removed 28 selfloop flow, removed 5 redundant places. [2025-03-04 02:11:46,597 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 214 flow [2025-03-04 02:11:46,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-04 02:11:46,598 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-04 02:11:46,598 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 214 flow [2025-03-04 02:11:46,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-04 02:11:46,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:46,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:46,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:11:46,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:46,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -10738564, now seen corresponding path program 1 times [2025-03-04 02:11:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21913262] [2025-03-04 02:11:46,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:46,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:46,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:11:46,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:11:46,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:46,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:47,345 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-04 02:11:47,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:47,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21913262] [2025-03-04 02:11:47,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21913262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:47,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:11:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514628931] [2025-03-04 02:11:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:47,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:11:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:47,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:11:47,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:11:47,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:47,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-04 02:11:47,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:47,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:47,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:48,171 INFO L124 PetriNetUnfolderBase]: 5852/8591 cut-off events. [2025-03-04 02:11:48,172 INFO L125 PetriNetUnfolderBase]: For 15405/15405 co-relation queries the response was YES. [2025-03-04 02:11:48,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27347 conditions, 8591 events. 5852/8591 cut-off events. For 15405/15405 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 45284 event pairs, 704 based on Foata normal form. 166/8756 useless extension candidates. Maximal degree in co-relation 27324. Up to 6426 conditions per place. [2025-03-04 02:11:48,213 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 75 selfloop transitions, 10 changer transitions 52/141 dead transitions. [2025-03-04 02:11:48,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 141 transitions, 884 flow [2025-03-04 02:11:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:11:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:11:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2025-03-04 02:11:48,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5067750677506775 [2025-03-04 02:11:48,215 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 214 flow. Second operand 9 states and 187 transitions. [2025-03-04 02:11:48,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 141 transitions, 884 flow [2025-03-04 02:11:48,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 861 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:11:48,241 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 289 flow [2025-03-04 02:11:48,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-03-04 02:11:48,242 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-04 02:11:48,243 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 289 flow [2025-03-04 02:11:48,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-04 02:11:48,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:48,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:11:48,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:48,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1247159135, now seen corresponding path program 1 times [2025-03-04 02:11:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670378436] [2025-03-04 02:11:48,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:48,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:11:48,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:11:48,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:48,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:48,442 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-04 02:11:48,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:48,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670378436] [2025-03-04 02:11:48,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670378436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:48,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:48,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:11:48,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265647283] [2025-03-04 02:11:48,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:48,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:11:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:48,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:11:48,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:11:48,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:48,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-04 02:11:48,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:48,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:49,422 INFO L124 PetriNetUnfolderBase]: 8382/12236 cut-off events. [2025-03-04 02:11:49,422 INFO L125 PetriNetUnfolderBase]: For 28831/28831 co-relation queries the response was YES. [2025-03-04 02:11:49,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41472 conditions, 12236 events. 8382/12236 cut-off events. For 28831/28831 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 69058 event pairs, 2442 based on Foata normal form. 208/12439 useless extension candidates. Maximal degree in co-relation 41445. Up to 5902 conditions per place. [2025-03-04 02:11:49,497 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 61 selfloop transitions, 5 changer transitions 50/120 dead transitions. [2025-03-04 02:11:49,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 846 flow [2025-03-04 02:11:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:11:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:11:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2025-03-04 02:11:49,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5261324041811847 [2025-03-04 02:11:49,499 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 289 flow. Second operand 7 states and 151 transitions. [2025-03-04 02:11:49,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 846 flow [2025-03-04 02:11:49,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 120 transitions, 816 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-04 02:11:49,563 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 298 flow [2025-03-04 02:11:49,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2025-03-04 02:11:49,565 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-03-04 02:11:49,566 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 298 flow [2025-03-04 02:11:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-04 02:11:49,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:49,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:49,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:11:49,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:49,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 158311614, now seen corresponding path program 1 times [2025-03-04 02:11:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827264638] [2025-03-04 02:11:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:49,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:11:49,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:11:49,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:49,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:50,489 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-04 02:11:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827264638] [2025-03-04 02:11:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827264638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:50,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:11:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27200483] [2025-03-04 02:11:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:50,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:11:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:50,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:11:50,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:11:50,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:50,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 298 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-04 02:11:50,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:50,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:50,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:51,987 INFO L124 PetriNetUnfolderBase]: 9019/13389 cut-off events. [2025-03-04 02:11:51,987 INFO L125 PetriNetUnfolderBase]: For 38233/38235 co-relation queries the response was YES. [2025-03-04 02:11:52,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46542 conditions, 13389 events. 9019/13389 cut-off events. For 38233/38235 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 76225 event pairs, 1271 based on Foata normal form. 290/13678 useless extension candidates. Maximal degree in co-relation 46513. Up to 8540 conditions per place. [2025-03-04 02:11:52,041 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 91 selfloop transitions, 23 changer transitions 65/183 dead transitions. [2025-03-04 02:11:52,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 183 transitions, 1364 flow [2025-03-04 02:11:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:11:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:11:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2025-03-04 02:11:52,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5146341463414634 [2025-03-04 02:11:52,042 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 298 flow. Second operand 10 states and 211 transitions. [2025-03-04 02:11:52,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 183 transitions, 1364 flow [2025-03-04 02:11:52,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 183 transitions, 1326 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 02:11:52,139 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 500 flow [2025-03-04 02:11:52,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=500, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2025-03-04 02:11:52,140 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2025-03-04 02:11:52,140 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 500 flow [2025-03-04 02:11:52,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-04 02:11:52,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:52,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:52,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:11:52,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:52,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -970990814, now seen corresponding path program 2 times [2025-03-04 02:11:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017234798] [2025-03-04 02:11:52,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:11:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:52,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:11:52,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:11:52,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:11:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:52,306 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-04 02:11:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017234798] [2025-03-04 02:11:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017234798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:52,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:52,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:11:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584456546] [2025-03-04 02:11:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:52,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:11:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:52,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:11:52,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:11:52,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:11:52,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-04 02:11:52,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:52,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:11:52,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:53,192 INFO L124 PetriNetUnfolderBase]: 6507/10032 cut-off events. [2025-03-04 02:11:53,192 INFO L125 PetriNetUnfolderBase]: For 39702/39708 co-relation queries the response was YES. [2025-03-04 02:11:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38255 conditions, 10032 events. 6507/10032 cut-off events. For 39702/39708 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 59837 event pairs, 1013 based on Foata normal form. 526/10553 useless extension candidates. Maximal degree in co-relation 38224. Up to 4659 conditions per place. [2025-03-04 02:11:53,227 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 122 selfloop transitions, 5 changer transitions 12/144 dead transitions. [2025-03-04 02:11:53,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 144 transitions, 1404 flow [2025-03-04 02:11:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:11:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:11:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-04 02:11:53,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-04 02:11:53,228 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 500 flow. Second operand 4 states and 104 transitions. [2025-03-04 02:11:53,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 144 transitions, 1404 flow [2025-03-04 02:11:53,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 1394 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:11:53,249 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 500 flow [2025-03-04 02:11:53,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=500, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2025-03-04 02:11:53,249 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2025-03-04 02:11:53,249 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 500 flow [2025-03-04 02:11:53,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-04 02:11:53,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:53,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:11:53,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1068191133, now seen corresponding path program 1 times [2025-03-04 02:11:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-03-04 02:11:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:53,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:11:53,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:11:53,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:53,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:54,353 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-04 02:11:54,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:54,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-03-04 02:11:54,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295332620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:54,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:54,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:11:54,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818532316] [2025-03-04 02:11:54,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:54,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:11:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:54,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:11:54,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:11:54,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:54,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 500 flow. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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-04 02:11:54,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:54,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:54,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:55,581 INFO L124 PetriNetUnfolderBase]: 6633/10045 cut-off events. [2025-03-04 02:11:55,582 INFO L125 PetriNetUnfolderBase]: For 38723/38723 co-relation queries the response was YES. [2025-03-04 02:11:55,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41004 conditions, 10045 events. 6633/10045 cut-off events. For 38723/38723 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 56175 event pairs, 1603 based on Foata normal form. 158/10195 useless extension candidates. Maximal degree in co-relation 40971. Up to 5950 conditions per place. [2025-03-04 02:11:55,631 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 70 selfloop transitions, 12 changer transitions 92/178 dead transitions. [2025-03-04 02:11:55,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 178 transitions, 1621 flow [2025-03-04 02:11:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:11:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:11:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2025-03-04 02:11:55,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2025-03-04 02:11:55,633 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 500 flow. Second operand 9 states and 194 transitions. [2025-03-04 02:11:55,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 178 transitions, 1621 flow [2025-03-04 02:11:55,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 178 transitions, 1595 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:11:55,655 INFO L231 Difference]: Finished difference. Result has 85 places, 60 transitions, 500 flow [2025-03-04 02:11:55,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=500, PETRI_PLACES=85, PETRI_TRANSITIONS=60} [2025-03-04 02:11:55,656 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2025-03-04 02:11:55,656 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 60 transitions, 500 flow [2025-03-04 02:11:55,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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-04 02:11:55,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:55,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:11:55,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1675393953, now seen corresponding path program 1 times [2025-03-04 02:11:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890201972] [2025-03-04 02:11:55,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:55,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:11:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:11:55,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:55,800 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-04 02:11:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890201972] [2025-03-04 02:11:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890201972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:55,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:55,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:11:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104011850] [2025-03-04 02:11:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:55,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:11:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:55,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:11:55,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:11:55,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:11:55,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 60 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-04 02:11:55,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:55,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:11:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:56,282 INFO L124 PetriNetUnfolderBase]: 3073/4815 cut-off events. [2025-03-04 02:11:56,282 INFO L125 PetriNetUnfolderBase]: For 27551/27557 co-relation queries the response was YES. [2025-03-04 02:11:56,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19915 conditions, 4815 events. 3073/4815 cut-off events. For 27551/27557 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 25222 event pairs, 433 based on Foata normal form. 288/5099 useless extension candidates. Maximal degree in co-relation 19877. Up to 1664 conditions per place. [2025-03-04 02:11:56,310 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 99 selfloop transitions, 8 changer transitions 9/121 dead transitions. [2025-03-04 02:11:56,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1272 flow [2025-03-04 02:11:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:11:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:11:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-04 02:11:56,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2025-03-04 02:11:56,312 INFO L175 Difference]: Start difference. First operand has 85 places, 60 transitions, 500 flow. Second operand 5 states and 127 transitions. [2025-03-04 02:11:56,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1272 flow [2025-03-04 02:11:56,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 121 transitions, 1236 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 02:11:56,332 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 516 flow [2025-03-04 02:11:56,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=516, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2025-03-04 02:11:56,333 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2025-03-04 02:11:56,333 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 516 flow [2025-03-04 02:11:56,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-04 02:11:56,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:56,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:56,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:11:56,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:56,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash -417704400, now seen corresponding path program 1 times [2025-03-04 02:11:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:56,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635222083] [2025-03-04 02:11:56,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:11:56,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:11:56,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:56,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:56,567 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-04 02:11:56,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635222083] [2025-03-04 02:11:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635222083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:56,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:56,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:11:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558917622] [2025-03-04 02:11:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:56,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:11:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:56,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:11:56,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:11:56,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:11:56,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:56,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:56,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:11:56,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:56,933 INFO L124 PetriNetUnfolderBase]: 1981/3067 cut-off events. [2025-03-04 02:11:56,933 INFO L125 PetriNetUnfolderBase]: For 18311/18317 co-relation queries the response was YES. [2025-03-04 02:11:56,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13358 conditions, 3067 events. 1981/3067 cut-off events. For 18311/18317 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 14729 event pairs, 337 based on Foata normal form. 104/3167 useless extension candidates. Maximal degree in co-relation 13321. Up to 1120 conditions per place. [2025-03-04 02:11:56,949 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 84 selfloop transitions, 11 changer transitions 10/110 dead transitions. [2025-03-04 02:11:56,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 1126 flow [2025-03-04 02:11:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:11:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:11:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-04 02:11:56,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.516260162601626 [2025-03-04 02:11:56,950 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 516 flow. Second operand 6 states and 127 transitions. [2025-03-04 02:11:56,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 1126 flow [2025-03-04 02:11:56,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 987 flow, removed 58 selfloop flow, removed 9 redundant places. [2025-03-04 02:11:56,987 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 436 flow [2025-03-04 02:11:56,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2025-03-04 02:11:56,988 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2025-03-04 02:11:56,988 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 436 flow [2025-03-04 02:11:56,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:56,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:56,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:56,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:11:56,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:56,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1069695064, now seen corresponding path program 1 times [2025-03-04 02:11:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22099237] [2025-03-04 02:11:56,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:56,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:56,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:11:57,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:11:57,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:57,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:57,477 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-04 02:11:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22099237] [2025-03-04 02:11:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22099237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:57,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:11:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116744916] [2025-03-04 02:11:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:57,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:11:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:57,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:11:57,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:11:57,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:57,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 436 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-04 02:11:57,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:57,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:57,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:57,968 INFO L124 PetriNetUnfolderBase]: 1766/2745 cut-off events. [2025-03-04 02:11:57,968 INFO L125 PetriNetUnfolderBase]: For 10198/10200 co-relation queries the response was YES. [2025-03-04 02:11:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 2745 events. 1766/2745 cut-off events. For 10198/10200 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12776 event pairs, 196 based on Foata normal form. 8/2752 useless extension candidates. Maximal degree in co-relation 10712. Up to 1250 conditions per place. [2025-03-04 02:11:57,983 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 63 selfloop transitions, 14 changer transitions 53/134 dead transitions. [2025-03-04 02:11:57,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 1148 flow [2025-03-04 02:11:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:11:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:11:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2025-03-04 02:11:57,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2025-03-04 02:11:57,984 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 436 flow. Second operand 9 states and 161 transitions. [2025-03-04 02:11:57,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 1148 flow [2025-03-04 02:11:58,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 134 transitions, 849 flow, removed 77 selfloop flow, removed 15 redundant places. [2025-03-04 02:11:58,004 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 376 flow [2025-03-04 02:11:58,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=376, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2025-03-04 02:11:58,005 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2025-03-04 02:11:58,005 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 376 flow [2025-03-04 02:11:58,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-04 02:11:58,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:58,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:11:58,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:58,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1236611190, now seen corresponding path program 2 times [2025-03-04 02:11:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013257900] [2025-03-04 02:11:58,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:11:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:11:58,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:11:58,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:11:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:59,338 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-04 02:11:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013257900] [2025-03-04 02:11:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013257900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:11:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899351623] [2025-03-04 02:11:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:11:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:11:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:11:59,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:11:59,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 376 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-04 02:11:59,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:59,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:11:59,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:59,897 INFO L124 PetriNetUnfolderBase]: 1581/2469 cut-off events. [2025-03-04 02:11:59,897 INFO L125 PetriNetUnfolderBase]: For 4390/4390 co-relation queries the response was YES. [2025-03-04 02:11:59,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8006 conditions, 2469 events. 1581/2469 cut-off events. For 4390/4390 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11436 event pairs, 158 based on Foata normal form. 8/2477 useless extension candidates. Maximal degree in co-relation 7979. Up to 1125 conditions per place. [2025-03-04 02:11:59,907 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 88 selfloop transitions, 21 changer transitions 29/142 dead transitions. [2025-03-04 02:11:59,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 142 transitions, 1018 flow [2025-03-04 02:11:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:11:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:11:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2025-03-04 02:11:59,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035476718403548 [2025-03-04 02:11:59,908 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 376 flow. Second operand 11 states and 182 transitions. [2025-03-04 02:11:59,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 142 transitions, 1018 flow [2025-03-04 02:11:59,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 142 transitions, 961 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-04 02:11:59,914 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 491 flow [2025-03-04 02:11:59,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=491, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2025-03-04 02:11:59,916 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2025-03-04 02:11:59,916 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 491 flow [2025-03-04 02:11:59,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-04 02:11:59,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:59,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:59,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:11:59,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:59,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1793448608, now seen corresponding path program 3 times [2025-03-04 02:11:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365969108] [2025-03-04 02:11:59,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:11:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:59,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:11:59,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:11:59,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:11:59,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:00,626 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-04 02:12:00,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:00,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365969108] [2025-03-04 02:12:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365969108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:00,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:12:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809004051] [2025-03-04 02:12:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:00,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:00,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:00,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:00,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 491 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-04 02:12:00,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:00,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:00,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:01,002 INFO L124 PetriNetUnfolderBase]: 1449/2255 cut-off events. [2025-03-04 02:12:01,002 INFO L125 PetriNetUnfolderBase]: For 5200/5200 co-relation queries the response was YES. [2025-03-04 02:12:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7639 conditions, 2255 events. 1449/2255 cut-off events. For 5200/5200 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10022 event pairs, 310 based on Foata normal form. 8/2263 useless extension candidates. Maximal degree in co-relation 7611. Up to 1694 conditions per place. [2025-03-04 02:12:01,012 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 66 selfloop transitions, 17 changer transitions 26/113 dead transitions. [2025-03-04 02:12:01,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 113 transitions, 893 flow [2025-03-04 02:12:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:12:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:12:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2025-03-04 02:12:01,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3604336043360434 [2025-03-04 02:12:01,016 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 491 flow. Second operand 9 states and 133 transitions. [2025-03-04 02:12:01,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 113 transitions, 893 flow [2025-03-04 02:12:01,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 850 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:01,023 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 519 flow [2025-03-04 02:12:01,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-03-04 02:12:01,024 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2025-03-04 02:12:01,025 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 519 flow [2025-03-04 02:12:01,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-04 02:12:01,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:01,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:01,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:12:01,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -504112868, now seen corresponding path program 4 times [2025-03-04 02:12:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933358783] [2025-03-04 02:12:01,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:01,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:01,100 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:01,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:01,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:02,187 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-04 02:12:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933358783] [2025-03-04 02:12:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933358783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:02,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:02,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:12:02,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421658507] [2025-03-04 02:12:02,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:02,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:02,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:02,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:02,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:02,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-04 02:12:02,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 519 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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-04 02:12:02,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:02,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-04 02:12:02,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:02,855 INFO L124 PetriNetUnfolderBase]: 1997/3097 cut-off events. [2025-03-04 02:12:02,855 INFO L125 PetriNetUnfolderBase]: For 9796/9796 co-relation queries the response was YES. [2025-03-04 02:12:02,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11253 conditions, 3097 events. 1997/3097 cut-off events. For 9796/9796 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14681 event pairs, 554 based on Foata normal form. 8/3105 useless extension candidates. Maximal degree in co-relation 11223. Up to 2036 conditions per place. [2025-03-04 02:12:02,868 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 71 selfloop transitions, 27 changer transitions 56/158 dead transitions. [2025-03-04 02:12:02,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 158 transitions, 1426 flow [2025-03-04 02:12:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2025-03-04 02:12:02,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4124168514412417 [2025-03-04 02:12:02,869 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 519 flow. Second operand 11 states and 186 transitions. [2025-03-04 02:12:02,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 158 transitions, 1426 flow [2025-03-04 02:12:02,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 158 transitions, 1376 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:02,879 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 804 flow [2025-03-04 02:12:02,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=804, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2025-03-04 02:12:02,880 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2025-03-04 02:12:02,880 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 804 flow [2025-03-04 02:12:02,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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-04 02:12:02,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:02,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:12:02,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:02,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1135865252, now seen corresponding path program 5 times [2025-03-04 02:12:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731638228] [2025-03-04 02:12:02,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:02,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:02,914 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:02,914 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:02,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:03,571 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-04 02:12:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731638228] [2025-03-04 02:12:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731638228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:03,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:12:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68579424] [2025-03-04 02:12:03,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:12:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:03,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:12:03,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:12:03,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:03,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 804 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-04 02:12:03,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:03,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:03,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:04,137 INFO L124 PetriNetUnfolderBase]: 2372/3711 cut-off events. [2025-03-04 02:12:04,137 INFO L125 PetriNetUnfolderBase]: For 11316/11318 co-relation queries the response was YES. [2025-03-04 02:12:04,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13143 conditions, 3711 events. 2372/3711 cut-off events. For 11316/11318 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18495 event pairs, 623 based on Foata normal form. 8/3718 useless extension candidates. Maximal degree in co-relation 13110. Up to 1448 conditions per place. [2025-03-04 02:12:04,154 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 85 selfloop transitions, 24 changer transitions 55/168 dead transitions. [2025-03-04 02:12:04,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 168 transitions, 1489 flow [2025-03-04 02:12:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:12:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:12:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2025-03-04 02:12:04,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2025-03-04 02:12:04,155 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 804 flow. Second operand 9 states and 157 transitions. [2025-03-04 02:12:04,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 168 transitions, 1489 flow [2025-03-04 02:12:04,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 168 transitions, 1460 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 02:12:04,170 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 793 flow [2025-03-04 02:12:04,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2025-03-04 02:12:04,171 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 44 predicate places. [2025-03-04 02:12:04,171 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 793 flow [2025-03-04 02:12:04,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-04 02:12:04,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:04,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:04,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:12:04,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:04,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash -322335262, now seen corresponding path program 6 times [2025-03-04 02:12:04,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:04,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700045625] [2025-03-04 02:12:04,172 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:04,178 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:04,197 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:04,197 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:12:04,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:04,648 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-04 02:12:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:04,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700045625] [2025-03-04 02:12:04,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700045625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:04,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:04,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583126296] [2025-03-04 02:12:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:04,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:12:04,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:04,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:12:04,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:12:04,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:04,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 793 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-04 02:12:04,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:04,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:04,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:05,182 INFO L124 PetriNetUnfolderBase]: 2693/4266 cut-off events. [2025-03-04 02:12:05,182 INFO L125 PetriNetUnfolderBase]: For 13542/13544 co-relation queries the response was YES. [2025-03-04 02:12:05,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15331 conditions, 4266 events. 2693/4266 cut-off events. For 13542/13544 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 22239 event pairs, 750 based on Foata normal form. 8/4273 useless extension candidates. Maximal degree in co-relation 15296. Up to 1645 conditions per place. [2025-03-04 02:12:05,199 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 25 changer transitions 44/184 dead transitions. [2025-03-04 02:12:05,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 184 transitions, 1716 flow [2025-03-04 02:12:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2025-03-04 02:12:05,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2025-03-04 02:12:05,202 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 793 flow. Second operand 12 states and 206 transitions. [2025-03-04 02:12:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 184 transitions, 1716 flow [2025-03-04 02:12:05,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 184 transitions, 1607 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-03-04 02:12:05,222 INFO L231 Difference]: Finished difference. Result has 95 places, 76 transitions, 712 flow [2025-03-04 02:12:05,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=712, PETRI_PLACES=95, PETRI_TRANSITIONS=76} [2025-03-04 02:12:05,222 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2025-03-04 02:12:05,222 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 76 transitions, 712 flow [2025-03-04 02:12:05,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-04 02:12:05,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:05,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:05,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:12:05,223 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:05,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1997920886, now seen corresponding path program 7 times [2025-03-04 02:12:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612594191] [2025-03-04 02:12:05,223 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:05,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:05,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:05,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:05,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:06,580 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-04 02:12:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612594191] [2025-03-04 02:12:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612594191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:12:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570137732] [2025-03-04 02:12:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:06,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:06,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:06,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 76 transitions, 712 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-04 02:12:06,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:06,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:06,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,123 INFO L124 PetriNetUnfolderBase]: 2222/3552 cut-off events. [2025-03-04 02:12:07,123 INFO L125 PetriNetUnfolderBase]: For 9094/9094 co-relation queries the response was YES. [2025-03-04 02:12:07,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11794 conditions, 3552 events. 2222/3552 cut-off events. For 9094/9094 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18076 event pairs, 380 based on Foata normal form. 16/3568 useless extension candidates. Maximal degree in co-relation 11759. Up to 1387 conditions per place. [2025-03-04 02:12:07,137 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 102 selfloop transitions, 20 changer transitions 44/170 dead transitions. [2025-03-04 02:12:07,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 170 transitions, 1404 flow [2025-03-04 02:12:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 02:12:07,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4279379157427938 [2025-03-04 02:12:07,139 INFO L175 Difference]: Start difference. First operand has 95 places, 76 transitions, 712 flow. Second operand 11 states and 193 transitions. [2025-03-04 02:12:07,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 170 transitions, 1404 flow [2025-03-04 02:12:07,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 170 transitions, 1314 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:07,150 INFO L231 Difference]: Finished difference. Result has 94 places, 67 transitions, 578 flow [2025-03-04 02:12:07,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=578, PETRI_PLACES=94, PETRI_TRANSITIONS=67} [2025-03-04 02:12:07,151 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2025-03-04 02:12:07,151 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 67 transitions, 578 flow [2025-03-04 02:12:07,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-04 02:12:07,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:07,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:07,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:12:07,151 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:07,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1786159668, now seen corresponding path program 8 times [2025-03-04 02:12:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:07,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566719018] [2025-03-04 02:12:07,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:07,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:07,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:07,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:07,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:07,808 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-04 02:12:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566719018] [2025-03-04 02:12:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566719018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:07,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:07,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22351326] [2025-03-04 02:12:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:07,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:12:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:07,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:12:07,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:12:07,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:07,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 67 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-04 02:12:07,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:07,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:07,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:08,294 INFO L124 PetriNetUnfolderBase]: 1952/3098 cut-off events. [2025-03-04 02:12:08,294 INFO L125 PetriNetUnfolderBase]: For 7954/7954 co-relation queries the response was YES. [2025-03-04 02:12:08,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10309 conditions, 3098 events. 1952/3098 cut-off events. For 7954/7954 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15237 event pairs, 474 based on Foata normal form. 16/3114 useless extension candidates. Maximal degree in co-relation 10277. Up to 1430 conditions per place. [2025-03-04 02:12:08,310 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 60 selfloop transitions, 12 changer transitions 43/119 dead transitions. [2025-03-04 02:12:08,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 119 transitions, 1022 flow [2025-03-04 02:12:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:12:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:12:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-04 02:12:08,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2025-03-04 02:12:08,311 INFO L175 Difference]: Start difference. First operand has 94 places, 67 transitions, 578 flow. Second operand 9 states and 144 transitions. [2025-03-04 02:12:08,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 119 transitions, 1022 flow [2025-03-04 02:12:08,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 119 transitions, 913 flow, removed 30 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:08,324 INFO L231 Difference]: Finished difference. Result has 92 places, 60 transitions, 453 flow [2025-03-04 02:12:08,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=453, PETRI_PLACES=92, PETRI_TRANSITIONS=60} [2025-03-04 02:12:08,325 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2025-03-04 02:12:08,325 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 60 transitions, 453 flow [2025-03-04 02:12:08,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-04 02:12:08,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:08,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:08,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:12:08,325 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:08,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 846172722, now seen corresponding path program 9 times [2025-03-04 02:12:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:08,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257136668] [2025-03-04 02:12:08,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:08,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:08,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:08,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:08,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:08,663 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-04 02:12:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257136668] [2025-03-04 02:12:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257136668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540944028] [2025-03-04 02:12:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:08,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:08,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:08,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:08,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 60 transitions, 453 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-04 02:12:08,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:08,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:08,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:09,019 INFO L124 PetriNetUnfolderBase]: 1767/2791 cut-off events. [2025-03-04 02:12:09,019 INFO L125 PetriNetUnfolderBase]: For 7256/7256 co-relation queries the response was YES. [2025-03-04 02:12:09,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8973 conditions, 2791 events. 1767/2791 cut-off events. For 7256/7256 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13294 event pairs, 938 based on Foata normal form. 8/2799 useless extension candidates. Maximal degree in co-relation 8943. Up to 1872 conditions per place. [2025-03-04 02:12:09,031 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 50 selfloop transitions, 7 changer transitions 41/102 dead transitions. [2025-03-04 02:12:09,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 102 transitions, 837 flow [2025-03-04 02:12:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:12:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:12:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2025-03-04 02:12:09,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34146341463414637 [2025-03-04 02:12:09,032 INFO L175 Difference]: Start difference. First operand has 92 places, 60 transitions, 453 flow. Second operand 10 states and 140 transitions. [2025-03-04 02:12:09,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 102 transitions, 837 flow [2025-03-04 02:12:09,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 102 transitions, 750 flow, removed 17 selfloop flow, removed 12 redundant places. [2025-03-04 02:12:09,040 INFO L231 Difference]: Finished difference. Result has 88 places, 57 transitions, 372 flow [2025-03-04 02:12:09,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=372, PETRI_PLACES=88, PETRI_TRANSITIONS=57} [2025-03-04 02:12:09,040 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2025-03-04 02:12:09,040 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 57 transitions, 372 flow [2025-03-04 02:12:09,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-04 02:12:09,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:09,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:09,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:12:09,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -934749794, now seen corresponding path program 10 times [2025-03-04 02:12:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056352273] [2025-03-04 02:12:09,041 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:09,047 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:09,069 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:09,070 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:09,602 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-04 02:12:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056352273] [2025-03-04 02:12:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056352273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942140897] [2025-03-04 02:12:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:12:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:12:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:12:09,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-04 02:12:09,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 57 transitions, 372 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:09,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:09,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-04 02:12:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:09,938 INFO L124 PetriNetUnfolderBase]: 1379/2187 cut-off events. [2025-03-04 02:12:09,938 INFO L125 PetriNetUnfolderBase]: For 3604/3604 co-relation queries the response was YES. [2025-03-04 02:12:09,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6568 conditions, 2187 events. 1379/2187 cut-off events. For 3604/3604 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9864 event pairs, 250 based on Foata normal form. 8/2195 useless extension candidates. Maximal degree in co-relation 6541. Up to 1117 conditions per place. [2025-03-04 02:12:09,946 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 60 selfloop transitions, 12 changer transitions 32/108 dead transitions. [2025-03-04 02:12:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 108 transitions, 779 flow [2025-03-04 02:12:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:12:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:12:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-03-04 02:12:09,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2025-03-04 02:12:09,947 INFO L175 Difference]: Start difference. First operand has 88 places, 57 transitions, 372 flow. Second operand 9 states and 150 transitions. [2025-03-04 02:12:09,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 108 transitions, 779 flow [2025-03-04 02:12:09,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 712 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-03-04 02:12:09,953 INFO L231 Difference]: Finished difference. Result has 84 places, 51 transitions, 313 flow [2025-03-04 02:12:09,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=84, PETRI_TRANSITIONS=51} [2025-03-04 02:12:09,954 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2025-03-04 02:12:09,954 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 51 transitions, 313 flow [2025-03-04 02:12:09,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:09,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:09,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:09,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:12:09,954 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:09,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1346042326, now seen corresponding path program 11 times [2025-03-04 02:12:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862453036] [2025-03-04 02:12:09,955 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:09,962 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:09,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:09,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:09,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:10,800 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-04 02:12:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862453036] [2025-03-04 02:12:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862453036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:12:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719712791] [2025-03-04 02:12:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:10,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:10,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:10,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-04 02:12:10,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 51 transitions, 313 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-04 02:12:10,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:10,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-04 02:12:10,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:11,214 INFO L124 PetriNetUnfolderBase]: 1202/1916 cut-off events. [2025-03-04 02:12:11,214 INFO L125 PetriNetUnfolderBase]: For 2712/2712 co-relation queries the response was YES. [2025-03-04 02:12:11,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5911 conditions, 1916 events. 1202/1916 cut-off events. For 2712/2712 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8466 event pairs, 88 based on Foata normal form. 8/1924 useless extension candidates. Maximal degree in co-relation 5885. Up to 557 conditions per place. [2025-03-04 02:12:11,222 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 77 selfloop transitions, 11 changer transitions 34/126 dead transitions. [2025-03-04 02:12:11,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 824 flow [2025-03-04 02:12:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2025-03-04 02:12:11,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.376940133037694 [2025-03-04 02:12:11,223 INFO L175 Difference]: Start difference. First operand has 84 places, 51 transitions, 313 flow. Second operand 11 states and 170 transitions. [2025-03-04 02:12:11,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 824 flow [2025-03-04 02:12:11,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 126 transitions, 704 flow, removed 37 selfloop flow, removed 16 redundant places. [2025-03-04 02:12:11,230 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 239 flow [2025-03-04 02:12:11,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=239, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2025-03-04 02:12:11,231 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2025-03-04 02:12:11,231 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 239 flow [2025-03-04 02:12:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-04 02:12:11,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:11,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:12:11,231 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -682226270, now seen corresponding path program 12 times [2025-03-04 02:12:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255744674] [2025-03-04 02:12:11,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:11,238 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:11,275 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:11,276 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:12:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:12:11,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:12:11,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:11,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:11,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:11,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:12:11,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:12:11,364 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:12:11,365 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-04 02:12:11,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:12:11,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-04 02:12:11,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 02:12:11,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 02:12:11,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:12:11,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 02:12:11,367 INFO L422 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:11,432 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:12:11,432 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:12:11,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:12:11 BasicIcfg [2025-03-04 02:12:11,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:12:11,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:12:11,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:12:11,437 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:12:11,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:41" (3/4) ... [2025-03-04 02:12:11,438 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:12:11,520 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-04 02:12:11,561 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:12:11,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:12:11,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:12:11,563 INFO L158 Benchmark]: Toolchain (without parser) took 31610.04ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.4MB in the beginning and 512.2MB in the end (delta: -407.9MB). Peak memory consumption was 830.2MB. Max. memory is 16.1GB. [2025-03-04 02:12:11,563 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:11,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.80ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 78.5MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:12:11,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:11,565 INFO L158 Benchmark]: Boogie Preprocessor took 38.49ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:12:11,565 INFO L158 Benchmark]: IcfgBuilder took 703.13ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 65.9MB in the end (delta: 6.5MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-03-04 02:12:11,565 INFO L158 Benchmark]: TraceAbstraction took 30225.92ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 65.1MB in the beginning and 529.0MB in the end (delta: -463.9MB). Peak memory consumption was 773.8MB. Max. memory is 16.1GB. [2025-03-04 02:12:11,565 INFO L158 Benchmark]: Witness Printer took 126.22ms. Allocated memory is still 1.4GB. Free memory was 529.0MB in the beginning and 512.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:12:11,566 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.80ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 78.5MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.49ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 703.13ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 65.9MB in the end (delta: 6.5MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30225.92ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 65.1MB in the beginning and 529.0MB in the end (delta: -463.9MB). Peak memory consumption was 773.8MB. Max. memory is 16.1GB. * Witness Printer took 126.22ms. Allocated memory is still 1.4GB. Free memory was 529.0MB in the beginning and 512.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 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: 30.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1801 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1778 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 342 mSDsCounter, 295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6010 IncrementalHoareTripleChecker+Invalid, 6305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 295 mSolverCounterUnsat, 13 mSDtfsCounter, 6010 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=14, InterpolantAutomatonStates: 183, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 5389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-04 02:12:11,589 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE