./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:58:59,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:58:59,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:58:59,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:58:59,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:58:59,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:58:59,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:58:59,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:58:59,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:58:59,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:58:59,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:58:59,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:58:59,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:58:59,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:58:59,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:58:59,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:58:59,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:58:59,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:58:59,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:58:59,116 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-jdk21/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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2025-02-08 00:58:59,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:58:59,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:58:59,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:58:59,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:58:59,349 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:58:59,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-02-08 00:59:00,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a48ebb465/2f0de6306be34d7f8475ff3103a03888/FLAGda9d06bb2 [2025-02-08 00:59:00,928 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:59:00,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-02-08 00:59:00,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a48ebb465/2f0de6306be34d7f8475ff3103a03888/FLAGda9d06bb2 [2025-02-08 00:59:01,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a48ebb465/2f0de6306be34d7f8475ff3103a03888 [2025-02-08 00:59:01,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:59:01,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:59:01,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:59:01,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:59:01,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:59:01,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a7d30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01, skipping insertion in model container [2025-02-08 00:59:01,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:59:01,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2025-02-08 00:59:01,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:59:01,432 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:59:01,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2025-02-08 00:59:01,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:59:01,496 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:59:01,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01 WrapperNode [2025-02-08 00:59:01,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:59:01,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:59:01,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:59:01,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:59:01,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,526 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-02-08 00:59:01,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:59:01,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:59:01,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:59:01,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:59:01,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,545 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-02-08 00:59:01,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:59:01,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:59:01,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:59:01,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:59:01,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (1/1) ... [2025-02-08 00:59:01,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:59:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:59:01,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:59:01,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:59:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 00:59:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:59:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 00:59:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 00:59:01,616 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 00:59:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 00:59:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 00:59:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 00:59:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-08 00:59:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-08 00:59:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:59:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 00:59:01,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:59:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:59:01,618 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:59:01,728 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:59:01,730 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:59:02,086 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:59:02,086 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:59:02,317 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:59:02,317 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:59:02,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:59:02 BoogieIcfgContainer [2025-02-08 00:59:02,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:59:02,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:59:02,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:59:02,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:59:02,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:59:01" (1/3) ... [2025-02-08 00:59:02,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baffdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:59:02, skipping insertion in model container [2025-02-08 00:59:02,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:59:01" (2/3) ... [2025-02-08 00:59:02,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baffdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:59:02, skipping insertion in model container [2025-02-08 00:59:02,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:59:02" (3/3) ... [2025-02-08 00:59:02,324 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2025-02-08 00:59:02,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:59:02,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 00:59:02,335 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:59:02,380 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:59:02,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-02-08 00:59:02,438 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-02-08 00:59:02,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:59:02,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-02-08 00:59:02,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-02-08 00:59:02,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-02-08 00:59:02,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:59:02,470 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;@3a52ff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:59:02,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 00:59:02,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:59:02,481 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-02-08 00:59:02,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:59:02,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:02,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:59:02,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:02,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2010554085, now seen corresponding path program 1 times [2025-02-08 00:59:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063411046] [2025-02-08 00:59:02,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:02,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:02,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 00:59:02,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:59:02,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:02,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063411046] [2025-02-08 00:59:02,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063411046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:02,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 00:59:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147934094] [2025-02-08 00:59:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:03,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:59:03,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:03,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:59:03,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:59:03,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:59:03,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02-08 00:59:03,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:03,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:59:03,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:06,946 INFO L124 PetriNetUnfolderBase]: 47373/62901 cut-off events. [2025-02-08 00:59:06,946 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-02-08 00:59:07,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125595 conditions, 62901 events. 47373/62901 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 365084 event pairs, 6261 based on Foata normal form. 1764/64322 useless extension candidates. Maximal degree in co-relation 125583. Up to 53209 conditions per place. [2025-02-08 00:59:07,286 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 56 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-02-08 00:59:07,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 266 flow [2025-02-08 00:59:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:59:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:59:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-08 00:59:07,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-02-08 00:59:07,296 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 96 transitions. [2025-02-08 00:59:07,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 266 flow [2025-02-08 00:59:07,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 00:59:07,309 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-02-08 00:59:07,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-02-08 00:59:07,313 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-02-08 00:59:07,313 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-02-08 00:59:07,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02-08 00:59:07,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:07,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:59:07,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:59:07,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1574510233, now seen corresponding path program 1 times [2025-02-08 00:59:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034500263] [2025-02-08 00:59:07,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:07,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 00:59:07,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 00:59:07,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:07,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:07,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034500263] [2025-02-08 00:59:07,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034500263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:07,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:07,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:59:07,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051712835] [2025-02-08 00:59:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:07,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:59:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:07,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:59:07,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:59:07,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:59:07,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-08 00:59:07,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:07,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:59:07,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:12,781 INFO L124 PetriNetUnfolderBase]: 69225/92693 cut-off events. [2025-02-08 00:59:12,782 INFO L125 PetriNetUnfolderBase]: For 2992/2992 co-relation queries the response was YES. [2025-02-08 00:59:12,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187221 conditions, 92693 events. 69225/92693 cut-off events. For 2992/2992 co-relation queries the response was YES. Maximal size of possible extension queue 2690. Compared 574529 event pairs, 35971 based on Foata normal form. 0/90931 useless extension candidates. Maximal degree in co-relation 187211. Up to 61559 conditions per place. [2025-02-08 00:59:13,163 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 50 selfloop transitions, 5 changer transitions 88/148 dead transitions. [2025-02-08 00:59:13,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 148 transitions, 612 flow [2025-02-08 00:59:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:59:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:59:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2025-02-08 00:59:13,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425 [2025-02-08 00:59:13,165 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 217 transitions. [2025-02-08 00:59:13,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 148 transitions, 612 flow [2025-02-08 00:59:13,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 148 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 00:59:13,173 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 149 flow [2025-02-08 00:59:13,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2025-02-08 00:59:13,174 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-02-08 00:59:13,174 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 149 flow [2025-02-08 00:59:13,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-08 00:59:13,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:13,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:59:13,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:59:13,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:13,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1575909030, now seen corresponding path program 1 times [2025-02-08 00:59:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048501583] [2025-02-08 00:59:13,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:13,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:13,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:59:13,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:59:13,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:13,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:13,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048501583] [2025-02-08 00:59:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048501583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:13,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:59:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820909694] [2025-02-08 00:59:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:59:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:59:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:59:13,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:59:13,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:59:13,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:13,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:59:13,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:17,809 INFO L124 PetriNetUnfolderBase]: 52321/70173 cut-off events. [2025-02-08 00:59:17,810 INFO L125 PetriNetUnfolderBase]: For 53522/53522 co-relation queries the response was YES. [2025-02-08 00:59:18,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178316 conditions, 70173 events. 52321/70173 cut-off events. For 53522/53522 co-relation queries the response was YES. Maximal size of possible extension queue 1990. Compared 427852 event pairs, 14323 based on Foata normal form. 1708/71850 useless extension candidates. Maximal degree in co-relation 178301. Up to 45075 conditions per place. [2025-02-08 00:59:18,307 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 62 selfloop transitions, 3 changer transitions 79/149 dead transitions. [2025-02-08 00:59:18,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 149 transitions, 759 flow [2025-02-08 00:59:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:59:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 00:59:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2025-02-08 00:59:18,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-02-08 00:59:18,315 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 149 flow. Second operand 7 states and 205 transitions. [2025-02-08 00:59:18,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 149 transitions, 759 flow [2025-02-08 00:59:19,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 149 transitions, 746 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 00:59:19,517 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 159 flow [2025-02-08 00:59:19,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-02-08 00:59:19,519 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-02-08 00:59:19,519 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 159 flow [2025-02-08 00:59:19,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:59:19,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:19,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:59:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:59:19,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1649402412, now seen corresponding path program 1 times [2025-02-08 00:59:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:19,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420847588] [2025-02-08 00:59:19,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:19,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:59:19,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:59:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420847588] [2025-02-08 00:59:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420847588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:59:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589764812] [2025-02-08 00:59:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:59:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:19,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:59:19,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:59:19,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:59:19,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:59:19,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:19,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:59:19,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:23,724 INFO L124 PetriNetUnfolderBase]: 45777/61361 cut-off events. [2025-02-08 00:59:23,725 INFO L125 PetriNetUnfolderBase]: For 60107/60107 co-relation queries the response was YES. [2025-02-08 00:59:23,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159878 conditions, 61361 events. 45777/61361 cut-off events. For 60107/60107 co-relation queries the response was YES. Maximal size of possible extension queue 1580. Compared 356249 event pairs, 10139 based on Foata normal form. 1260/62576 useless extension candidates. Maximal degree in co-relation 159859. Up to 38761 conditions per place. [2025-02-08 00:59:24,184 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 58 selfloop transitions, 3 changer transitions 71/137 dead transitions. [2025-02-08 00:59:24,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 137 transitions, 702 flow [2025-02-08 00:59:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:59:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 00:59:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2025-02-08 00:59:24,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5514285714285714 [2025-02-08 00:59:24,185 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 159 flow. Second operand 7 states and 193 transitions. [2025-02-08 00:59:24,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 137 transitions, 702 flow [2025-02-08 00:59:25,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 678 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 00:59:25,150 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 164 flow [2025-02-08 00:59:25,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-02-08 00:59:25,151 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-02-08 00:59:25,151 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 164 flow [2025-02-08 00:59:25,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:59:25,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:25,152 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-02-08 00:59:25,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:59:25,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:25,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash -677135368, now seen corresponding path program 1 times [2025-02-08 00:59:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:25,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246733434] [2025-02-08 00:59:25,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:25,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 00:59:25,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 00:59:25,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:25,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246733434] [2025-02-08 00:59:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246733434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:59:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462951637] [2025-02-08 00:59:25,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:25,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:59:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:25,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:59:25,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:59:25,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:59:25,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02-08 00:59:25,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:25,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:59:25,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:28,440 INFO L124 PetriNetUnfolderBase]: 34237/47281 cut-off events. [2025-02-08 00:59:28,440 INFO L125 PetriNetUnfolderBase]: For 46470/46470 co-relation queries the response was YES. [2025-02-08 00:59:28,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123347 conditions, 47281 events. 34237/47281 cut-off events. For 46470/46470 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 290581 event pairs, 4877 based on Foata normal form. 1764/49010 useless extension candidates. Maximal degree in co-relation 123327. Up to 23653 conditions per place. [2025-02-08 00:59:28,832 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 81 selfloop transitions, 6 changer transitions 1/94 dead transitions. [2025-02-08 00:59:28,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 498 flow [2025-02-08 00:59:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:59:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:59:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-02-08 00:59:28,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-02-08 00:59:28,836 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 164 flow. Second operand 4 states and 130 transitions. [2025-02-08 00:59:28,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 498 flow [2025-02-08 00:59:29,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 480 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-08 00:59:29,122 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 192 flow [2025-02-08 00:59:29,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-02-08 00:59:29,123 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-02-08 00:59:29,123 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 192 flow [2025-02-08 00:59:29,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02-08 00:59:29,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:29,123 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-02-08 00:59:29,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:59:29,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:29,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash 471531730, now seen corresponding path program 1 times [2025-02-08 00:59:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:29,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081620987] [2025-02-08 00:59:29,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 00:59:29,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:59:29,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:29,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:29,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081620987] [2025-02-08 00:59:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081620987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:29,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:29,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:59:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2684205] [2025-02-08 00:59:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:29,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:59:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:29,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:59:29,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:59:29,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:59:29,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-02-08 00:59:29,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:29,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:59:29,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:31,587 INFO L124 PetriNetUnfolderBase]: 23313/32453 cut-off events. [2025-02-08 00:59:31,587 INFO L125 PetriNetUnfolderBase]: For 30966/30966 co-relation queries the response was YES. [2025-02-08 00:59:31,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90189 conditions, 32453 events. 23313/32453 cut-off events. For 30966/30966 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 190263 event pairs, 2855 based on Foata normal form. 1364/33782 useless extension candidates. Maximal degree in co-relation 90171. Up to 10777 conditions per place. [2025-02-08 00:59:31,783 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 10 changer transitions 1/121 dead transitions. [2025-02-08 00:59:31,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 671 flow [2025-02-08 00:59:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:59:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 00:59:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-02-08 00:59:31,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-02-08 00:59:31,785 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 192 flow. Second operand 5 states and 168 transitions. [2025-02-08 00:59:31,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 671 flow [2025-02-08 00:59:31,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 660 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 00:59:31,793 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 244 flow [2025-02-08 00:59:31,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-02-08 00:59:31,794 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-02-08 00:59:31,794 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 244 flow [2025-02-08 00:59:31,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-02-08 00:59:31,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:31,794 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] [2025-02-08 00:59:31,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:59:31,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:31,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1145939676, now seen corresponding path program 1 times [2025-02-08 00:59:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:31,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619672847] [2025-02-08 00:59:31,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:59:31,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:59:31,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:32,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619672847] [2025-02-08 00:59:32,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619672847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:32,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:32,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:59:32,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573990683] [2025-02-08 00:59:32,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:32,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:59:32,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:32,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:59:32,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:59:32,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:59:32,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-02-08 00:59:32,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:32,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:59:32,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:59:33,270 INFO L124 PetriNetUnfolderBase]: 15089/20889 cut-off events. [2025-02-08 00:59:33,271 INFO L125 PetriNetUnfolderBase]: For 28576/28576 co-relation queries the response was YES. [2025-02-08 00:59:33,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61759 conditions, 20889 events. 15089/20889 cut-off events. For 28576/28576 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 113215 event pairs, 2465 based on Foata normal form. 644/21498 useless extension candidates. Maximal degree in co-relation 61739. Up to 6412 conditions per place. [2025-02-08 00:59:33,362 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 125 selfloop transitions, 14 changer transitions 1/146 dead transitions. [2025-02-08 00:59:33,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 860 flow [2025-02-08 00:59:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:59:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:59:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-02-08 00:59:33,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-02-08 00:59:33,363 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 244 flow. Second operand 6 states and 204 transitions. [2025-02-08 00:59:33,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 146 transitions, 860 flow [2025-02-08 00:59:33,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 146 transitions, 830 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 00:59:33,483 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 294 flow [2025-02-08 00:59:33,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-02-08 00:59:33,484 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-02-08 00:59:33,484 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 294 flow [2025-02-08 00:59:33,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-02-08 00:59:33,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:59:33,484 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, 1, 1] [2025-02-08 00:59:33,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:59:33,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:59:33,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:59:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1912383294, now seen corresponding path program 1 times [2025-02-08 00:59:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:59:33,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179415909] [2025-02-08 00:59:33,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:59:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:59:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 00:59:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 00:59:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:59:33,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:59:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:59:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:59:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179415909] [2025-02-08 00:59:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179415909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:59:34,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:59:34,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 00:59:34,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754143891] [2025-02-08 00:59:34,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:59:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:59:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:59:34,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:59:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:59:34,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:59:34,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 294 flow. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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-02-08 00:59:34,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:59:34,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:59:34,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand