./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.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-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:26:23,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:26:23,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:26:23,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:26:23,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:26:23,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:26:23,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:26:23,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:26:23,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:26:23,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:26:23,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:26:23,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:26:23,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:26:23,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:26:23,153 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:26:23,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:26:23,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:26:23,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:26:23,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:23,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:26:23,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:26:23,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:26:23,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:26:23,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:26:23,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:26:23,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:26:23,156 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2025-03-13 21:26:23,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:26:23,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:26:23,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:26:23,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:26:23,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:26:23,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2025-03-13 21:26:24,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9571fdc3b/84eca2784f77480192ff425192e6963d/FLAGd3541d951 [2025-03-13 21:26:24,813 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:26:24,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2025-03-13 21:26:24,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9571fdc3b/84eca2784f77480192ff425192e6963d/FLAGd3541d951 [2025-03-13 21:26:25,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9571fdc3b/84eca2784f77480192ff425192e6963d [2025-03-13 21:26:25,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:26:25,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:26:25,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:25,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:26:25,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:26:25,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f13cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25, skipping insertion in model container [2025-03-13 21:26:25,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:26:25,287 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-atomic/lamport.i[32541,32554] [2025-03-13 21:26:25,291 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-atomic/lamport.i[32909,32922] [2025-03-13 21:26:25,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:25,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:26:25,335 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-atomic/lamport.i[32541,32554] [2025-03-13 21:26:25,337 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-atomic/lamport.i[32909,32922] [2025-03-13 21:26:25,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:25,364 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:26:25,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25 WrapperNode [2025-03-13 21:26:25,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:25,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:25,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:26:25,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:26:25,370 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:26:25" (1/1) ... [2025-03-13 21:26:25,378 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:26:25" (1/1) ... [2025-03-13 21:26:25,392 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-03-13 21:26:25,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:25,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:26:25,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:26:25,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:26:25,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,410 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:26:25,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:26:25,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:26:25,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:26:25,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:26:25,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (1/1) ... [2025-03-13 21:26:25,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:25,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:25,446 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:26:25,448 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:26:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-13 21:26:25,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-13 21:26:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:26:25,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:26:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:26:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:26:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:26:25,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:26:25,466 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:26:25,551 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:26:25,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:26:25,672 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:26:25,673 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:26:25,673 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:26:25,717 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:26:25,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:25 BoogieIcfgContainer [2025-03-13 21:26:25,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:26:25,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:26:25,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:26:25,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:26:25,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:26:25" (1/3) ... [2025-03-13 21:26:25,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2254bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:25, skipping insertion in model container [2025-03-13 21:26:25,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:25" (2/3) ... [2025-03-13 21:26:25,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2254bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:25, skipping insertion in model container [2025-03-13 21:26:25,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:25" (3/3) ... [2025-03-13 21:26:25,725 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport.i [2025-03-13 21:26:25,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:26:25,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport.i that has 3 procedures, 51 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-13 21:26:25,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:26:25,782 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:26:25,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 66 transitions, 146 flow [2025-03-13 21:26:25,836 INFO L124 PetriNetUnfolderBase]: 16/64 cut-off events. [2025-03-13 21:26:25,837 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:26:25,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 16/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 61. Up to 3 conditions per place. [2025-03-13 21:26:25,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 66 transitions, 146 flow [2025-03-13 21:26:25,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 62 transitions, 133 flow [2025-03-13 21:26:25,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:25,859 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;@6ea1a683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:25,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:26:25,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:25,868 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-03-13 21:26:25,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:25,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:25,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:25,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:25,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash 861292557, now seen corresponding path program 1 times [2025-03-13 21:26:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:25,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430642441] [2025-03-13 21:26:25,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:25,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:26:25,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:26:25,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:25,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:26,023 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:26,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:26,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430642441] [2025-03-13 21:26:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430642441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:26,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:26,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:26:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449946873] [2025-03-13 21:26:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:26:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:26,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:26:26,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:26:26,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2025-03-13 21:26:26,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 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:26,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:26,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2025-03-13 21:26:26,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:26,201 INFO L124 PetriNetUnfolderBase]: 371/784 cut-off events. [2025-03-13 21:26:26,201 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:26:26,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 784 events. 371/784 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4207 event pairs, 232 based on Foata normal form. 66/691 useless extension candidates. Maximal degree in co-relation 1220. Up to 459 conditions per place. [2025-03-13 21:26:26,209 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 22 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2025-03-13 21:26:26,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 169 flow [2025-03-13 21:26:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:26:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:26:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-03-13 21:26:26,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2025-03-13 21:26:26,218 INFO L175 Difference]: Start difference. First operand has 53 places, 62 transitions, 133 flow. Second operand 2 states and 102 transitions. [2025-03-13 21:26:26,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 169 flow [2025-03-13 21:26:26,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:26:26,223 INFO L231 Difference]: Finished difference. Result has 51 places, 58 transitions, 120 flow [2025-03-13 21:26:26,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=58} [2025-03-13 21:26:26,227 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2025-03-13 21:26:26,227 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 58 transitions, 120 flow [2025-03-13 21:26:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 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:26,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:26,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:26:26,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1068539851, now seen corresponding path program 1 times [2025-03-13 21:26:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550952733] [2025-03-13 21:26:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:26,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:26,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:26,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:26,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:26,330 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:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550952733] [2025-03-13 21:26:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550952733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:26,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:26,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490009337] [2025-03-13 21:26:26,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:26,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:26,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:26,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-13 21:26:26,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:26,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:26,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-13 21:26:26,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:26,453 INFO L124 PetriNetUnfolderBase]: 522/1054 cut-off events. [2025-03-13 21:26:26,453 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:26:26,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1054 events. 522/1054 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5716 event pairs, 200 based on Foata normal form. 33/942 useless extension candidates. Maximal degree in co-relation 1791. Up to 443 conditions per place. [2025-03-13 21:26:26,461 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 3/72 dead transitions. [2025-03-13 21:26:26,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 229 flow [2025-03-13 21:26:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-13 21:26:26,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-13 21:26:26,463 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 120 flow. Second operand 3 states and 144 transitions. [2025-03-13 21:26:26,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 229 flow [2025-03-13 21:26:26,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:26:26,465 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 140 flow [2025-03-13 21:26:26,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2025-03-13 21:26:26,467 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-13 21:26:26,467 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 140 flow [2025-03-13 21:26:26,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:26,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:26,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:26,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:26:26,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:26,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1832869174, now seen corresponding path program 1 times [2025-03-13 21:26:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893692384] [2025-03-13 21:26:26,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:26,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:26:26,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:26:26,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:26,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:26,505 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:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893692384] [2025-03-13 21:26:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893692384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:26,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609881188] [2025-03-13 21:26:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:26,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:26,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:26,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-13 21:26:26,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:26,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:26,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-13 21:26:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:26,633 INFO L124 PetriNetUnfolderBase]: 521/1025 cut-off events. [2025-03-13 21:26:26,633 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-13 21:26:26,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 1025 events. 521/1025 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5375 event pairs, 231 based on Foata normal form. 31/919 useless extension candidates. Maximal degree in co-relation 1894. Up to 524 conditions per place. [2025-03-13 21:26:26,640 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 31 selfloop transitions, 2 changer transitions 7/72 dead transitions. [2025-03-13 21:26:26,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 247 flow [2025-03-13 21:26:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-13 21:26:26,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-13 21:26:26,643 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 140 flow. Second operand 3 states and 144 transitions. [2025-03-13 21:26:26,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 247 flow [2025-03-13 21:26:26,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:26,645 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 144 flow [2025-03-13 21:26:26,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-03-13 21:26:26,647 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-03-13 21:26:26,647 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 144 flow [2025-03-13 21:26:26,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:26,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:26,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:26,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:26:26,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1834195003, now seen corresponding path program 1 times [2025-03-13 21:26:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917658288] [2025-03-13 21:26:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:26,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:26:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:26:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:26,718 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:26,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:26,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917658288] [2025-03-13 21:26:26,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917658288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:26,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:26,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281810014] [2025-03-13 21:26:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:26,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:26,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:26,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:26,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2025-03-13 21:26:26,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:26,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:26,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2025-03-13 21:26:26,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:26,891 INFO L124 PetriNetUnfolderBase]: 756/1475 cut-off events. [2025-03-13 21:26:26,891 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-03-13 21:26:26,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 1475 events. 756/1475 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8325 event pairs, 375 based on Foata normal form. 16/1359 useless extension candidates. Maximal degree in co-relation 2744. Up to 888 conditions per place. [2025-03-13 21:26:26,897 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 38 selfloop transitions, 5 changer transitions 2/73 dead transitions. [2025-03-13 21:26:26,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 264 flow [2025-03-13 21:26:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-13 21:26:26,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2025-03-13 21:26:26,899 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 144 flow. Second operand 3 states and 137 transitions. [2025-03-13 21:26:26,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 264 flow [2025-03-13 21:26:26,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:26:26,901 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 188 flow [2025-03-13 21:26:26,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2025-03-13 21:26:26,901 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-03-13 21:26:26,902 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 188 flow [2025-03-13 21:26:26,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:26,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:26,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:26,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:26:26,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -310986899, now seen corresponding path program 2 times [2025-03-13 21:26:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063180640] [2025-03-13 21:26:26,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:26,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:26:26,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:26:26,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:26,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:26,951 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:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063180640] [2025-03-13 21:26:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063180640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48642376] [2025-03-13 21:26:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:26,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-13 21:26:26,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:26,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:26,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-13 21:26:26,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:27,108 INFO L124 PetriNetUnfolderBase]: 1089/2254 cut-off events. [2025-03-13 21:26:27,108 INFO L125 PetriNetUnfolderBase]: For 596/637 co-relation queries the response was YES. [2025-03-13 21:26:27,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 2254 events. 1089/2254 cut-off events. For 596/637 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15226 event pairs, 331 based on Foata normal form. 36/2099 useless extension candidates. Maximal degree in co-relation 4643. Up to 785 conditions per place. [2025-03-13 21:26:27,117 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-03-13 21:26:27,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 351 flow [2025-03-13 21:26:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-03-13 21:26:27,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-03-13 21:26:27,118 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 188 flow. Second operand 3 states and 150 transitions. [2025-03-13 21:26:27,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 351 flow [2025-03-13 21:26:27,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:27,146 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 206 flow [2025-03-13 21:26:27,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2025-03-13 21:26:27,146 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2025-03-13 21:26:27,146 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 206 flow [2025-03-13 21:26:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:27,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:27,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:27,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:26:27,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1674779859, now seen corresponding path program 3 times [2025-03-13 21:26:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508993668] [2025-03-13 21:26:27,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:27,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:26:27,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:26:27,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:26:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:27,175 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:27,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:27,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508993668] [2025-03-13 21:26:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508993668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114718134] [2025-03-13 21:26:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:27,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:27,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:27,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:27,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2025-03-13 21:26:27,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:27,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2025-03-13 21:26:27,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:27,346 INFO L124 PetriNetUnfolderBase]: 1135/2334 cut-off events. [2025-03-13 21:26:27,346 INFO L125 PetriNetUnfolderBase]: For 635/685 co-relation queries the response was YES. [2025-03-13 21:26:27,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5153 conditions, 2334 events. 1135/2334 cut-off events. For 635/685 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15575 event pairs, 621 based on Foata normal form. 71/2291 useless extension candidates. Maximal degree in co-relation 5145. Up to 1474 conditions per place. [2025-03-13 21:26:27,355 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 37 selfloop transitions, 5 changer transitions 9/80 dead transitions. [2025-03-13 21:26:27,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 351 flow [2025-03-13 21:26:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-03-13 21:26:27,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6868686868686869 [2025-03-13 21:26:27,356 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 206 flow. Second operand 3 states and 136 transitions. [2025-03-13 21:26:27,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 351 flow [2025-03-13 21:26:27,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:27,359 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 224 flow [2025-03-13 21:26:27,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2025-03-13 21:26:27,359 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2025-03-13 21:26:27,359 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 224 flow [2025-03-13 21:26:27,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:27,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:27,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:26:27,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:27,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash -814640061, now seen corresponding path program 4 times [2025-03-13 21:26:27,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557744192] [2025-03-13 21:26:27,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:26:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:27,365 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:26:27,367 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-13 21:26:27,367 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:26:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:27,393 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:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557744192] [2025-03-13 21:26:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557744192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:27,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:27,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729164701] [2025-03-13 21:26:27,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:27,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:27,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:27,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:27,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-03-13 21:26:27,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:27,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-03-13 21:26:27,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:27,563 INFO L124 PetriNetUnfolderBase]: 866/2003 cut-off events. [2025-03-13 21:26:27,564 INFO L125 PetriNetUnfolderBase]: For 1065/1148 co-relation queries the response was YES. [2025-03-13 21:26:27,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2003 events. 866/2003 cut-off events. For 1065/1148 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14267 event pairs, 322 based on Foata normal form. 36/1939 useless extension candidates. Maximal degree in co-relation 4551. Up to 710 conditions per place. [2025-03-13 21:26:27,570 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 46 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-03-13 21:26:27,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 82 transitions, 395 flow [2025-03-13 21:26:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-03-13 21:26:27,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-03-13 21:26:27,571 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 224 flow. Second operand 3 states and 150 transitions. [2025-03-13 21:26:27,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 82 transitions, 395 flow [2025-03-13 21:26:27,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:27,576 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 216 flow [2025-03-13 21:26:27,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-13 21:26:27,576 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2025-03-13 21:26:27,576 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 216 flow [2025-03-13 21:26:27,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:27,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:27,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:26:27,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:27,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash -344228208, now seen corresponding path program 1 times [2025-03-13 21:26:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:27,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412202441] [2025-03-13 21:26:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:27,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:26:27,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:26:27,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:27,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:27,604 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:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412202441] [2025-03-13 21:26:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412202441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:27,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832947848] [2025-03-13 21:26:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:27,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:27,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:27,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2025-03-13 21:26:27,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:27,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2025-03-13 21:26:27,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:27,726 INFO L124 PetriNetUnfolderBase]: 780/1702 cut-off events. [2025-03-13 21:26:27,726 INFO L125 PetriNetUnfolderBase]: For 601/664 co-relation queries the response was YES. [2025-03-13 21:26:27,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1702 events. 780/1702 cut-off events. For 601/664 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11047 event pairs, 307 based on Foata normal form. 26/1650 useless extension candidates. Maximal degree in co-relation 3818. Up to 756 conditions per place. [2025-03-13 21:26:27,733 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 4/79 dead transitions. [2025-03-13 21:26:27,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 365 flow [2025-03-13 21:26:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-13 21:26:27,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2025-03-13 21:26:27,735 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 216 flow. Second operand 3 states and 147 transitions. [2025-03-13 21:26:27,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 365 flow [2025-03-13 21:26:27,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:26:27,737 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 225 flow [2025-03-13 21:26:27,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2025-03-13 21:26:27,737 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-13 21:26:27,737 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 225 flow [2025-03-13 21:26:27,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:27,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:26:27,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:26:27,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1398185958, now seen corresponding path program 1 times [2025-03-13 21:26:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285789248] [2025-03-13 21:26:27,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:27,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:26:27,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:26:27,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:27,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:27,774 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:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285789248] [2025-03-13 21:26:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285789248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:27,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243549537] [2025-03-13 21:26:27,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:27,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:26:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:27,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:26:27,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:26:27,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2025-03-13 21:26:27,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:27,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2025-03-13 21:26:27,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:27,876 INFO L124 PetriNetUnfolderBase]: 720/1625 cut-off events. [2025-03-13 21:26:27,878 INFO L125 PetriNetUnfolderBase]: For 834/883 co-relation queries the response was YES. [2025-03-13 21:26:27,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3942 conditions, 1625 events. 720/1625 cut-off events. For 834/883 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10516 event pairs, 283 based on Foata normal form. 17/1591 useless extension candidates. Maximal degree in co-relation 3932. Up to 711 conditions per place. [2025-03-13 21:26:27,882 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2025-03-13 21:26:27,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 378 flow [2025-03-13 21:26:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:26:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:26:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-13 21:26:27,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2025-03-13 21:26:27,884 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 225 flow. Second operand 3 states and 148 transitions. [2025-03-13 21:26:27,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 378 flow [2025-03-13 21:26:27,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 364 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:27,888 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-03-13 21:26:27,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-03-13 21:26:27,890 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-03-13 21:26:27,890 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-03-13 21:26:27,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-13 21:26:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-13 21:26:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-13 21:26:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-13 21:26:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-13 21:26:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-13 21:26:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:26:27,894 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-03-13 21:26:27,898 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:26:27,898 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:26:27,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:26:27 BasicIcfg [2025-03-13 21:26:27,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:26:27,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:26:27,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:26:27,905 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:26:27,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:25" (3/4) ... [2025-03-13 21:26:27,906 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:26:27,908 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-03-13 21:26:27,908 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-03-13 21:26:27,911 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-03-13 21:26:27,911 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-13 21:26:27,912 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-13 21:26:27,912 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:26:27,962 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:26:27,962 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:26:27,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:26:27,963 INFO L158 Benchmark]: Toolchain (without parser) took 2874.39ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 60.6MB in the end (delta: 66.7MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:27,963 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:27,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.57ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 107.7MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:27,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.95ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:26:27,964 INFO L158 Benchmark]: Boogie Preprocessor took 23.48ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:27,964 INFO L158 Benchmark]: IcfgBuilder took 297.99ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 84.2MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:27,964 INFO L158 Benchmark]: TraceAbstraction took 2184.29ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 66.1MB in the end (delta: 17.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:27,964 INFO L158 Benchmark]: Witness Printer took 58.15ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 60.6MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:27,965 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.57ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 107.7MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.95ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.48ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 297.99ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 84.2MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2184.29ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 66.1MB in the end (delta: 17.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 58.15ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 60.6MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 781]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 755]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 95 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 504 IncrementalHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 30 mSDtfsCounter, 504 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=8, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 171 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:26:27,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE