./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe023_tso.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-wmm/safe023_tso.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 b87483e693fd72a28f6c7edd484e610e6e0dbb17679c8092f6f9c9cd35d4acca --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:35:08,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:35:08,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:35:08,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:35:08,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:35:08,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:35:08,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:35:08,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:35:08,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:35:08,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:35:08,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:35:08,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:35:08,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:35:08,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:35:08,752 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:35:08,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:35:08,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:35:08,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:35:08,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:35:08,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:35:08,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:35:08,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:35:08,754 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 -> b87483e693fd72a28f6c7edd484e610e6e0dbb17679c8092f6f9c9cd35d4acca [2025-03-13 21:35:08,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:35:08,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:35:08,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:35:08,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:35:08,984 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:35:08,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_tso.i [2025-03-13 21:35:10,146 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131a7290e/1db0cbc471e94977a99b5bba27cf1c71/FLAG9f86bf7f6 [2025-03-13 21:35:10,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:35:10,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_tso.i [2025-03-13 21:35:10,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131a7290e/1db0cbc471e94977a99b5bba27cf1c71/FLAG9f86bf7f6 [2025-03-13 21:35:10,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131a7290e/1db0cbc471e94977a99b5bba27cf1c71 [2025-03-13 21:35:10,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:35:10,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:35:10,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:35:10,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:35:10,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:35:10,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762996bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10, skipping insertion in model container [2025-03-13 21:35:10,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:35:10,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_tso.i[945,958] [2025-03-13 21:35:10,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:35:10,720 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:35:10,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_tso.i[945,958] [2025-03-13 21:35:10,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:35:10,773 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:35:10,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10 WrapperNode [2025-03-13 21:35:10,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:35:10,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:35:10,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:35:10,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:35:10,779 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:35:10" (1/1) ... [2025-03-13 21:35:10,789 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:35:10" (1/1) ... [2025-03-13 21:35:10,805 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-13 21:35:10,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:35:10,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:35:10,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:35:10,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:35:10,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,826 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:35:10,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:35:10,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:35:10,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:35:10,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:35:10,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (1/1) ... [2025-03-13 21:35:10,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:35:10,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:35:10,866 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:35:10,871 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:35:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:35:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:35:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-13 21:35:10,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-13 21:35:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-13 21:35:10,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-13 21:35:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-13 21:35:10,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-13 21:35:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:35:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:35:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:35:10,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:35:10,888 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:35:10,975 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:35:10,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:35:11,103 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:35:11,104 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:35:11,104 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:35:11,180 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:35:11,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:35:11 BoogieIcfgContainer [2025-03-13 21:35:11,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:35:11,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:35:11,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:35:11,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:35:11,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:35:10" (1/3) ... [2025-03-13 21:35:11,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aeb95a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:35:11, skipping insertion in model container [2025-03-13 21:35:11,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:35:10" (2/3) ... [2025-03-13 21:35:11,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aeb95a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:35:11, skipping insertion in model container [2025-03-13 21:35:11,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:35:11" (3/3) ... [2025-03-13 21:35:11,188 INFO L128 eAbstractionObserver]: Analyzing ICFG safe023_tso.i [2025-03-13 21:35:11,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:35:11,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe023_tso.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-13 21:35:11,199 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:35:11,236 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:35:11,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-13 21:35:11,289 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-13 21:35:11,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:35:11,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-13 21:35:11,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-13 21:35:11,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-03-13 21:35:11,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:35:11,316 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;@6a95ac12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:35:11,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:35:11,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:35:11,325 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-13 21:35:11,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:35:11,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:11,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:35:11,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:35:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash -193255488, now seen corresponding path program 1 times [2025-03-13 21:35:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610770843] [2025-03-13 21:35:11,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:35:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:11,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:35:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:35:11,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:35:11,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:11,729 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:35:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610770843] [2025-03-13 21:35:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610770843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:11,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:35:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089638667] [2025-03-13 21:35:11,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:11,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:35:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:11,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:35:11,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:35:11,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:35:11,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:35:11,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:11,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:35:11,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:12,249 INFO L124 PetriNetUnfolderBase]: 3619/5687 cut-off events. [2025-03-13 21:35:12,249 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-13 21:35:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11126 conditions, 5687 events. 3619/5687 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 32406 event pairs, 661 based on Foata normal form. 252/5934 useless extension candidates. Maximal degree in co-relation 11115. Up to 2841 conditions per place. [2025-03-13 21:35:12,278 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 57 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2025-03-13 21:35:12,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 277 flow [2025-03-13 21:35:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:35:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:35:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-13 21:35:12,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-03-13 21:35:12,289 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 101 transitions. [2025-03-13 21:35:12,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 277 flow [2025-03-13 21:35:12,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:35:12,296 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-03-13 21:35:12,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-13 21:35:12,300 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-13 21:35:12,301 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-03-13 21:35:12,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:35:12,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:12,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:35:12,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:35:12,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:35:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -127267155, now seen corresponding path program 1 times [2025-03-13 21:35:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:12,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011836378] [2025-03-13 21:35:12,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:35:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:12,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:35:12,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:35:12,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:35:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:12,461 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:35:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011836378] [2025-03-13 21:35:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011836378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:35:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353894224] [2025-03-13 21:35:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:35:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:35:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:35:12,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:35:12,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:35:12,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:12,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:35:12,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:12,803 INFO L124 PetriNetUnfolderBase]: 2091/3295 cut-off events. [2025-03-13 21:35:12,803 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2025-03-13 21:35:12,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7555 conditions, 3295 events. 2091/3295 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 16357 event pairs, 427 based on Foata normal form. 172/3462 useless extension candidates. Maximal degree in co-relation 7543. Up to 1128 conditions per place. [2025-03-13 21:35:12,815 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 73 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2025-03-13 21:35:12,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 393 flow [2025-03-13 21:35:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:35:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:35:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-13 21:35:12,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2025-03-13 21:35:12,817 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 129 transitions. [2025-03-13 21:35:12,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 393 flow [2025-03-13 21:35:12,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 383 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:35:12,822 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2025-03-13 21:35:12,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-03-13 21:35:12,823 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2025-03-13 21:35:12,823 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2025-03-13 21:35:12,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:35:12,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:12,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:35:12,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:35:12,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:35:12,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1964566426, now seen corresponding path program 1 times [2025-03-13 21:35:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531744520] [2025-03-13 21:35:12,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:35:12,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:12,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:35:12,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:35:12,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:35:12,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:12,952 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:35:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531744520] [2025-03-13 21:35:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531744520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:35:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415026212] [2025-03-13 21:35:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:35:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:12,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:35:12,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:35:12,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:35:12,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:35:12,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:12,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:35:12,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:13,173 INFO L124 PetriNetUnfolderBase]: 1343/2071 cut-off events. [2025-03-13 21:35:13,173 INFO L125 PetriNetUnfolderBase]: For 1202/1202 co-relation queries the response was YES. [2025-03-13 21:35:13,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 2071 events. 1343/2071 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9178 event pairs, 385 based on Foata normal form. 60/2126 useless extension candidates. Maximal degree in co-relation 5159. Up to 788 conditions per place. [2025-03-13 21:35:13,185 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 61 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2025-03-13 21:35:13,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 380 flow [2025-03-13 21:35:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:35:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:35:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-13 21:35:13,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-13 21:35:13,189 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 129 transitions. [2025-03-13 21:35:13,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 380 flow [2025-03-13 21:35:13,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 355 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:35:13,199 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2025-03-13 21:35:13,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-03-13 21:35:13,201 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-03-13 21:35:13,201 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2025-03-13 21:35:13,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:35:13,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:13,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:35:13,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:35:13,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:35:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1711621087, now seen corresponding path program 1 times [2025-03-13 21:35:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087990171] [2025-03-13 21:35:13,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:35:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:13,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:35:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:35:13,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:35:13,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:13,360 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:35:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087990171] [2025-03-13 21:35:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087990171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:13,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:13,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:35:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576610780] [2025-03-13 21:35:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:13,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:35:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:13,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:35:13,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:35:13,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:35:13,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:35:13,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:13,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:35:13,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:13,812 INFO L124 PetriNetUnfolderBase]: 3089/4736 cut-off events. [2025-03-13 21:35:13,812 INFO L125 PetriNetUnfolderBase]: For 3318/3318 co-relation queries the response was YES. [2025-03-13 21:35:13,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12051 conditions, 4736 events. 3089/4736 cut-off events. For 3318/3318 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24442 event pairs, 736 based on Foata normal form. 16/4743 useless extension candidates. Maximal degree in co-relation 12036. Up to 1643 conditions per place. [2025-03-13 21:35:13,827 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 46 selfloop transitions, 6 changer transitions 68/124 dead transitions. [2025-03-13 21:35:13,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 124 transitions, 742 flow [2025-03-13 21:35:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:35:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:35:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2025-03-13 21:35:13,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2025-03-13 21:35:13,831 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 9 states and 174 transitions. [2025-03-13 21:35:13,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 124 transitions, 742 flow [2025-03-13 21:35:13,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 124 transitions, 564 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-03-13 21:35:13,848 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 160 flow [2025-03-13 21:35:13,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2025-03-13 21:35:13,849 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2025-03-13 21:35:13,849 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 160 flow [2025-03-13 21:35:13,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:35:13,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:13,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:35:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:35:13,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:35:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 457559929, now seen corresponding path program 2 times [2025-03-13 21:35:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664107447] [2025-03-13 21:35:13,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:35:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:13,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:35:13,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:35:13,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:35:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:13,964 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:35:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664107447] [2025-03-13 21:35:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664107447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:35:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282872303] [2025-03-13 21:35:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:35:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:13,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:35:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:35:13,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:35:13,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:35:13,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:13,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:35:13,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:14,242 INFO L124 PetriNetUnfolderBase]: 1550/2542 cut-off events. [2025-03-13 21:35:14,243 INFO L125 PetriNetUnfolderBase]: For 799/799 co-relation queries the response was YES. [2025-03-13 21:35:14,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6168 conditions, 2542 events. 1550/2542 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12551 event pairs, 84 based on Foata normal form. 8/2548 useless extension candidates. Maximal degree in co-relation 6149. Up to 1369 conditions per place. [2025-03-13 21:35:14,251 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 43 selfloop transitions, 5 changer transitions 54/106 dead transitions. [2025-03-13 21:35:14,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 563 flow [2025-03-13 21:35:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:35:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:35:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-13 21:35:14,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4775641025641026 [2025-03-13 21:35:14,255 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 160 flow. Second operand 8 states and 149 transitions. [2025-03-13 21:35:14,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 563 flow [2025-03-13 21:35:14,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 531 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-13 21:35:14,256 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 140 flow [2025-03-13 21:35:14,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-03-13 21:35:14,257 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-03-13 21:35:14,257 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 140 flow [2025-03-13 21:35:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:35:14,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:14,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:35:14,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:35:14,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:35:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1773272213, now seen corresponding path program 3 times [2025-03-13 21:35:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:14,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994927302] [2025-03-13 21:35:14,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:35:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:14,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:35:14,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:35:14,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:35:14,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:14,419 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:35:14,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994927302] [2025-03-13 21:35:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994927302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:14,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:14,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:35:14,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367459572] [2025-03-13 21:35:14,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:14,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:35:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:14,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:35:14,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:35:14,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:35:14,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:35:14,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:14,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:35:14,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:14,560 INFO L124 PetriNetUnfolderBase]: 785/1294 cut-off events. [2025-03-13 21:35:14,561 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-03-13 21:35:14,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3142 conditions, 1294 events. 785/1294 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5486 event pairs, 245 based on Foata normal form. 8/1300 useless extension candidates. Maximal degree in co-relation 3134. Up to 852 conditions per place. [2025-03-13 21:35:14,564 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2025-03-13 21:35:14,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 284 flow [2025-03-13 21:35:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:35:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:35:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-03-13 21:35:14,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-13 21:35:14,565 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 140 flow. Second operand 6 states and 93 transitions. [2025-03-13 21:35:14,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 284 flow [2025-03-13 21:35:14,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 260 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-13 21:35:14,569 INFO L231 Difference]: Finished difference. Result has 52 places, 0 transitions, 0 flow [2025-03-13 21:35:14,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=52, PETRI_TRANSITIONS=0} [2025-03-13 21:35:14,570 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-03-13 21:35:14,570 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 0 transitions, 0 flow [2025-03-13 21:35:14,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:35:14,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-13 21:35:14,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-13 21:35:14,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-13 21:35:14,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-13 21:35:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:35:14,574 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-13 21:35:14,576 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:35:14,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:35:14,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:35:14 BasicIcfg [2025-03-13 21:35:14,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:35:14,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:35:14,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:35:14,584 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:35:14,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:35:11" (3/4) ... [2025-03-13 21:35:14,586 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:35:14,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-13 21:35:14,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-13 21:35:14,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-13 21:35:14,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-03-13 21:35:14,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-13 21:35:14,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:35:14,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:35:14,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:35:14,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:35:14,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:35:14,649 INFO L158 Benchmark]: Toolchain (without parser) took 4195.49ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.4MB in the beginning and 85.2MB in the end (delta: 26.2MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. [2025-03-13 21:35:14,650 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:35:14,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.40ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 91.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:35:14,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.02ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:35:14,651 INFO L158 Benchmark]: Boogie Preprocessor took 32.52ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 88.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:35:14,651 INFO L158 Benchmark]: IcfgBuilder took 341.99ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 65.9MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:35:14,652 INFO L158 Benchmark]: TraceAbstraction took 3400.45ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 65.0MB in the beginning and 90.8MB in the end (delta: -25.8MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2025-03-13 21:35:14,652 INFO L158 Benchmark]: Witness Printer took 65.49ms. Allocated memory is still 268.4MB. Free memory was 90.8MB in the beginning and 85.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:35:14,653 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.40ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 91.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.02ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.52ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 88.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 341.99ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 65.9MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3400.45ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 65.0MB in the beginning and 90.8MB in the end (delta: -25.8MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. * Witness Printer took 65.49ms. Allocated memory is still 268.4MB. Free memory was 90.8MB in the beginning and 85.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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 7 procedures, 64 locations, 4 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: 3.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 959 IncrementalHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 6 mSDtfsCounter, 959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 38, 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.9s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:35:14,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE