./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/queue_ok_longer.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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:25:43,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:25:43,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:25:43,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:25:43,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:25:43,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:25:43,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:25:43,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:25:43,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:25:43,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:25:43,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:25:43,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:25:43,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:25:43,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:25:43,786 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:25:43,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:25:43,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:25:43,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:25:43,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:25:43,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:25:43,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:25:43,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:25:43,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:25:43,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:25:43,789 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2025-03-13 21:25:44,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:25:44,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:25:44,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:25:44,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:25:44,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:25:44,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2025-03-13 21:25:45,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3243edae6/9544956d1b934f7c8e7053c3c25d93e7/FLAG0548adce1 [2025-03-13 21:25:45,444 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:25:45,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2025-03-13 21:25:45,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3243edae6/9544956d1b934f7c8e7053c3c25d93e7/FLAG0548adce1 [2025-03-13 21:25:45,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3243edae6/9544956d1b934f7c8e7053c3c25d93e7 [2025-03-13 21:25:45,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:25:45,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:25:45,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:25:45,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:25:45,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:25:45,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:25:45" (1/1) ... [2025-03-13 21:25:45,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc570cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:45, skipping insertion in model container [2025-03-13 21:25:45,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:25:45" (1/1) ... [2025-03-13 21:25:45,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:25:46,099 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/queue_ok_longer.i[43272,43285] [2025-03-13 21:25:46,103 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/queue_ok_longer.i[43545,43558] [2025-03-13 21:25:46,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:25:46,141 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:25:46,186 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/queue_ok_longer.i[43272,43285] [2025-03-13 21:25:46,190 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/queue_ok_longer.i[43545,43558] [2025-03-13 21:25:46,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:25:46,283 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:25:46,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46 WrapperNode [2025-03-13 21:25:46,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:25:46,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:25:46,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:25:46,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:25:46,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,367 INFO L138 Inliner]: procedures = 274, calls = 852, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 991 [2025-03-13 21:25:46,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:25:46,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:25:46,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:25:46,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:25:46,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,411 INFO L175 MemorySlicer]: Split 835 memory accesses to 4 slices as follows [2, 5, 402, 426]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-03-13 21:25:46,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:25:46,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:25:46,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:25:46,462 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:25:46,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (1/1) ... [2025-03-13 21:25:46,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:25:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:46,488 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-13 21:25:46,490 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-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:25:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:25:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:25:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:25:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:25:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:25:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:25:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:25:46,510 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:25:46,619 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:25:46,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:25:47,521 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:25:47,522 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:25:47,523 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:25:59,437 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:25:59,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:25:59 BoogieIcfgContainer [2025-03-13 21:25:59,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:25:59,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:25:59,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:25:59,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:25:59,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:25:45" (1/3) ... [2025-03-13 21:25:59,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681827c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:25:59, skipping insertion in model container [2025-03-13 21:25:59,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:25:46" (2/3) ... [2025-03-13 21:25:59,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681827c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:25:59, skipping insertion in model container [2025-03-13 21:25:59,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:25:59" (3/3) ... [2025-03-13 21:25:59,447 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-03-13 21:25:59,460 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:25:59,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 34 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-13 21:25:59,463 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:25:59,544 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:25:59,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 40 transitions, 94 flow [2025-03-13 21:25:59,625 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-03-13 21:25:59,630 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:25:59,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 38 events. 7/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-03-13 21:25:59,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 40 transitions, 94 flow [2025-03-13 21:25:59,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 36 transitions, 81 flow [2025-03-13 21:25:59,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:25:59,656 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;@55da1916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:25:59,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:25:59,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:25:59,688 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-13 21:25:59,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:25:59,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:59,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-13 21:25:59,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:25:59,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2054015, now seen corresponding path program 1 times [2025-03-13 21:25:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595547785] [2025-03-13 21:25:59,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:59,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:59,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-13 21:25:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-13 21:25:59,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:59,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:00,124 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-13 21:26:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595547785] [2025-03-13 21:26:00,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595547785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:00,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:00,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:26:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684394486] [2025-03-13 21:26:00,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:00,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:26:00,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:26:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:26:00,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:00,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-13 21:26:00,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:00,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:00,404 INFO L124 PetriNetUnfolderBase]: 288/497 cut-off events. [2025-03-13 21:26:00,406 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-13 21:26:00,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 497 events. 288/497 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1978 event pairs, 197 based on Foata normal form. 15/435 useless extension candidates. Maximal degree in co-relation 910. Up to 458 conditions per place. [2025-03-13 21:26:00,413 INFO L140 encePairwiseOnDemand]: 38/40 looper letters, 25 selfloop transitions, 0 changer transitions 2/32 dead transitions. [2025-03-13 21:26:00,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 127 flow [2025-03-13 21:26:00,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:26:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:26:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-03-13 21:26:00,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-13 21:26:00,426 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 81 flow. Second operand 2 states and 45 transitions. [2025-03-13 21:26:00,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 127 flow [2025-03-13 21:26:00,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:26:00,433 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 64 flow [2025-03-13 21:26:00,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-03-13 21:26:00,438 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2025-03-13 21:26:00,438 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 64 flow [2025-03-13 21:26:00,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-13 21:26:00,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:00,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:00,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:26:00,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -843409793, now seen corresponding path program 1 times [2025-03-13 21:26:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413615981] [2025-03-13 21:26:00,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:00,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:26:00,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:26:00,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:00,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:00,881 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-13 21:26:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413615981] [2025-03-13 21:26:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413615981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:26:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445870924] [2025-03-13 21:26:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:00,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:00,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:00,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:00,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 21:26:00,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:00,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:00,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:01,052 INFO L124 PetriNetUnfolderBase]: 147/301 cut-off events. [2025-03-13 21:26:01,052 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:26:01,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 301 events. 147/301 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1062 event pairs, 76 based on Foata normal form. 13/279 useless extension candidates. Maximal degree in co-relation 588. Up to 146 conditions per place. [2025-03-13 21:26:01,056 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 27 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2025-03-13 21:26:01,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 149 flow [2025-03-13 21:26:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-13 21:26:01,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-13 21:26:01,058 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 64 flow. Second operand 3 states and 58 transitions. [2025-03-13 21:26:01,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 149 flow [2025-03-13 21:26:01,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:26:01,060 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 70 flow [2025-03-13 21:26:01,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-03-13 21:26:01,061 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-03-13 21:26:01,061 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 70 flow [2025-03-13 21:26:01,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 21:26:01,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:01,062 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-03-13 21:26:01,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:26:01,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash -412153511, now seen corresponding path program 1 times [2025-03-13 21:26:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685346496] [2025-03-13 21:26:01,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:26:01,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:26:01,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:01,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:01,283 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-13 21:26:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:01,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685346496] [2025-03-13 21:26:01,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685346496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:01,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349778074] [2025-03-13 21:26:01,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:01,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:01,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:01,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:01,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:01,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-13 21:26:01,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:01,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:01,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:01,481 INFO L124 PetriNetUnfolderBase]: 149/306 cut-off events. [2025-03-13 21:26:01,481 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 21:26:01,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 306 events. 149/306 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1055 event pairs, 118 based on Foata normal form. 8/294 useless extension candidates. Maximal degree in co-relation 624. Up to 257 conditions per place. [2025-03-13 21:26:01,483 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 28 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-13 21:26:01,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 144 flow [2025-03-13 21:26:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-13 21:26:01,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-13 21:26:01,485 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 70 flow. Second operand 3 states and 55 transitions. [2025-03-13 21:26:01,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 144 flow [2025-03-13 21:26:01,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:01,486 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 78 flow [2025-03-13 21:26:01,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-03-13 21:26:01,487 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-03-13 21:26:01,487 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 78 flow [2025-03-13 21:26:01,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-13 21:26:01,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:01,487 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-13 21:26:01,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:26:01,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:01,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 505696043, now seen corresponding path program 1 times [2025-03-13 21:26:01,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:01,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128656418] [2025-03-13 21:26:01,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:01,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:01,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:26:01,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:26:01,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:01,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128656418] [2025-03-13 21:26:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128656418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452715871] [2025-03-13 21:26:01,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:01,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:26:01,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:26:01,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:26:02,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:26:02,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:02,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:02,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1797 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:26:02,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:02,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:02,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452715871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:02,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:02,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-13 21:26:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067099406] [2025-03-13 21:26:02,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:02,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:26:02,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:02,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:26:02,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:26:02,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:02,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-13 21:26:02,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:02,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:02,396 INFO L124 PetriNetUnfolderBase]: 176/357 cut-off events. [2025-03-13 21:26:02,396 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 21:26:02,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 357 events. 176/357 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1215 event pairs, 118 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 787. Up to 257 conditions per place. [2025-03-13 21:26:02,398 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 43 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-13 21:26:02,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 234 flow [2025-03-13 21:26:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:26:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:26:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-03-13 21:26:02,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-03-13 21:26:02,399 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 6 states and 99 transitions. [2025-03-13 21:26:02,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 234 flow [2025-03-13 21:26:02,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:26:02,565 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 110 flow [2025-03-13 21:26:02,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-03-13 21:26:02,565 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2025-03-13 21:26:02,565 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 110 flow [2025-03-13 21:26:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-13 21:26:02,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:02,566 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:02,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:26:02,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:02,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1248525103, now seen corresponding path program 2 times [2025-03-13 21:26:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420816864] [2025-03-13 21:26:02,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:02,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:26:02,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-03-13 21:26:02,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:02,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:26:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420816864] [2025-03-13 21:26:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420816864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479548040] [2025-03-13 21:26:03,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:03,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:03,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:03,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:03,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:03,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:03,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 21:26:03,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:03,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:03,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:03,322 INFO L124 PetriNetUnfolderBase]: 130/299 cut-off events. [2025-03-13 21:26:03,322 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-13 21:26:03,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 299 events. 130/299 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1016 event pairs, 33 based on Foata normal form. 16/305 useless extension candidates. Maximal degree in co-relation 699. Up to 178 conditions per place. [2025-03-13 21:26:03,324 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 31 selfloop transitions, 3 changer transitions 1/40 dead transitions. [2025-03-13 21:26:03,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 197 flow [2025-03-13 21:26:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-13 21:26:03,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-13 21:26:03,326 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 110 flow. Second operand 3 states and 57 transitions. [2025-03-13 21:26:03,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 197 flow [2025-03-13 21:26:03,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 183 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:26:03,327 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2025-03-13 21:26:03,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2025-03-13 21:26:03,328 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2025-03-13 21:26:03,328 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2025-03-13 21:26:03,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 21:26:03,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:03,329 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:03,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:26:03,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1072292653, now seen corresponding path program 1 times [2025-03-13 21:26:03,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:03,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749849031] [2025-03-13 21:26:03,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:03,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:26:03,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:26:03,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:03,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749849031] [2025-03-13 21:26:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749849031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965075306] [2025-03-13 21:26:03,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:03,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:03,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:03,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:26:03,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:26:03,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:26:03,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:26:03,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:03,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:03,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1875 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:26:03,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:03,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:03,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965075306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:03,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-13 21:26:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110631213] [2025-03-13 21:26:03,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:03,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:26:03,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:03,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:26:03,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:26:03,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:03,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 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-13 21:26:03,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:03,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:03,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:04,441 INFO L124 PetriNetUnfolderBase]: 166/353 cut-off events. [2025-03-13 21:26:04,442 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-03-13 21:26:04,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 353 events. 166/353 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1099 event pairs, 90 based on Foata normal form. 36/374 useless extension candidates. Maximal degree in co-relation 899. Up to 207 conditions per place. [2025-03-13 21:26:04,443 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 63 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2025-03-13 21:26:04,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 386 flow [2025-03-13 21:26:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:26:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:26:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2025-03-13 21:26:04,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-13 21:26:04,445 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 12 states and 176 transitions. [2025-03-13 21:26:04,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 386 flow [2025-03-13 21:26:04,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:26:04,447 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 183 flow [2025-03-13 21:26:04,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=183, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2025-03-13 21:26:04,448 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2025-03-13 21:26:04,448 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 183 flow [2025-03-13 21:26:04,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 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-13 21:26:04,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:04,449 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:04,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:04,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:26:04,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1519156337, now seen corresponding path program 2 times [2025-03-13 21:26:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:04,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416229449] [2025-03-13 21:26:04,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:04,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:26:04,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:26:04,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:04,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416229449] [2025-03-13 21:26:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416229449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241558581] [2025-03-13 21:26:05,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:05,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:05,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:26:05,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:26:05,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:26:05,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:26:05,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:05,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:05,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 2019 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:26:05,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:05,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241558581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:05,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:05,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-13 21:26:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188626082] [2025-03-13 21:26:05,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:26:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:05,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:26:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:26:05,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-03-13 21:26:05,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 183 flow. Second operand has 25 states, 25 states have (on average 9.68) internal successors, (242), 25 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:05,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:05,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-03-13 21:26:05,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:06,354 INFO L124 PetriNetUnfolderBase]: 238/497 cut-off events. [2025-03-13 21:26:06,355 INFO L125 PetriNetUnfolderBase]: For 2908/2908 co-relation queries the response was YES. [2025-03-13 21:26:06,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 497 events. 238/497 cut-off events. For 2908/2908 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1496 event pairs, 90 based on Foata normal form. 72/554 useless extension candidates. Maximal degree in co-relation 1551. Up to 207 conditions per place. [2025-03-13 21:26:06,357 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 111 selfloop transitions, 23 changer transitions 0/139 dead transitions. [2025-03-13 21:26:06,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 767 flow [2025-03-13 21:26:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-13 21:26:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-13 21:26:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 338 transitions. [2025-03-13 21:26:06,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35208333333333336 [2025-03-13 21:26:06,359 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 183 flow. Second operand 24 states and 338 transitions. [2025-03-13 21:26:06,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 767 flow [2025-03-13 21:26:06,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 139 transitions, 695 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-13 21:26:06,367 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 303 flow [2025-03-13 21:26:06,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=303, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-03-13 21:26:06,369 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 52 predicate places. [2025-03-13 21:26:06,370 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 303 flow [2025-03-13 21:26:06,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.68) internal successors, (242), 25 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:06,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:06,371 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:06,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:06,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:06,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:26:06,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1055737487, now seen corresponding path program 3 times [2025-03-13 21:26:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608529218] [2025-03-13 21:26:06,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:06,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 12 equivalence classes. [2025-03-13 21:26:10,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:26:10,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-13 21:26:10,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608529218] [2025-03-13 21:26:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608529218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143385431] [2025-03-13 21:26:10,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:10,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:10,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:26:10,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:26:11,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 12 equivalence classes.